CIVL 1.2 Revision 2429

Downloads, Test and Coverage Reports, and Javadocs

Revision Information

Path: .
Working Copy Root Path: /usa/svn/work/civl/1.2/r2429
URL: svn://vsl.cis.udel.edu/civl/tags/1.2
Relative URL: ^/tags/1.2
Repository Root: svn://vsl.cis.udel.edu/civl
Repository UUID: fb995dde-84ed-4084-dfe6-e5aef3e2452c
Revision: 2429
Node Kind: directory
Schedule: normal
Last Changed Author: zmanchun
Last Changed Rev: 2429
Last Changed Date: 2015-07-13 00:15:54 -0400 (Mon, 13 Jul 2015)

Build output

Stdout:

Buildfile: /usa/svn/work/civl/1.2/r2429/build.xml

checkCommandParserChanges:

CommandParser:
     [move] Moving 1 file to /usa/svn/work/civl/1.2/r2429/src/edu/udel/cis/vsl/civl/run/common
     [move] Moving 1 file to /usa/svn/work/civl/1.2/r2429/src/edu/udel/cis/vsl/civl/run/common
     [move] Moving 1 file to /usa/svn/work/civl/1.2/r2429/src/edu/udel/cis/vsl/civl/run/common
     [move] Moving 1 file to /usa/svn/work/civl/1.2/r2429/src/edu/udel/cis/vsl/civl/run/common

compile:
    [mkdir] Created dir: /usa/svn/work/civl/1.2/r2429/bin
    [javac] Compiling 415 source files to /usa/svn/work/civl/1.2/r2429/bin
    [javac] Note: /usa/svn/work/civl/1.2/r2429/src/edu/udel/cis/vsl/civl/gui/common/GUI_revamp.java uses or overrides a deprecated API.
    [javac] Note: Recompile with -Xlint:deprecation for details.
    [javac] Note: /usa/svn/work/civl/1.2/r2429/src/edu/udel/cis/vsl/civl/gui/common/GUI_revamp.java uses unchecked or unsafe operations.
    [javac] Note: Recompile with -Xlint:unchecked for details.
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/state/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/common/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/kripke/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/seq/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/time/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/model/IF/type/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/dynamic/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/pointer/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/model/IF/expression/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/concurrency/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/util/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/pthread/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/predicate/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/bundle/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/transform/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/model/IF/variable/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/gui/common/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/config/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/string/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/model/IF/statement/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/asserts/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/domain/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/gui/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/scope/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/model/IF/location/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/model/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/run/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/comm/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/library/civlc/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/semantics/IF/package-info.class
    [javac] Creating empty /usa/svn/work/civl/1.2/r2429/bin/edu/udel/cis/vsl/civl/log/IF/package-info.class
     [copy] Copying 22 files to /usa/svn/work/civl/1.2/r2429/bin/include

jar:
      [jar] Building jar: /usa/svn/work/civl/1.2/r2429/civl.jar

test-init:
    [mkdir] Created dir: /usa/svn/work/civl/1.2/r2429/junit
    [mkdir] Created dir: /usa/svn/work/civl/1.2/r2429/junit/data
    [mkdir] Created dir: /usa/svn/work/civl/1.2/r2429/junit/reports
    [mkdir] Created dir: /usa/svn/work/civl/1.2/r2429/bin-test/regress

test-compile:
    [javac] Compiling 23 source files to /usa/svn/work/civl/1.2/r2429/bin-test/regress

test-run:
[jacoco:coverage] Enhancing junit with coverage
    [junit] Testsuite: edu.udel.cis.vsl.civl.AnalysisTest
    [junit] Tests run: 3, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 5.426 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === unreached code ===
    [junit] unreached.c:1.29-32 "(a)" from unreached.c:6.8-11 "MAX" from unreached.c:6.4-17 "a = (((a)>=( 1))?(a):( 1))"
    [junit] unreached.c:7.21-24 "100" from unreached.c:7.4-24 "a = a < 5 ? 10 : 100"
    [junit] unreached.c:11.8-11 "a=2"
    [junit] 
    [junit] 
    [junit] === Command ===
    [junit] civl verify -showUnreached=true -analyze_abs=false examples/analysis/unreached.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.96
    [junit]    memory (bytes)      : 155713536
    [junit]    max process count   : 1
    [junit]    states              : 7
    [junit]    states saved        : 5
    [junit]    state matches       : 0
    [junit]    transitions         : 6
    [junit]    trace steps         : 4
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === abs call analysis ===
    [junit] -:N 0:Y +:N abs.c:14.4-12 "a=abs(0)"
    [junit] -:Y 0:N +:N abs.c:15.4-12 "a=abs(x)"
    [junit] -:N 0:N +:Y abs.c:16.4-12 "a=abs(y)"
    [junit] -:Y 0:Y +:Y abs.c:17.4-12 "a=abs(z)"
    [junit] -:Y 0:N +:Y abs.c:18.4-12 "a=abs(k)"
    [junit] -:Y 0:Y +:Y abs.c:19.4-16 "a=abs(x*y*z)"
    [junit] -:Y 0:N +:Y abs.c:20.4-16 "a=abs(x*y*k)"
    [junit] -:Y 0:N +:N abs.c:21.4-14 "a=abs(x*y)"
    [junit] -:Y 0:Y +:N abs.c:24.4-16 "a=abs(y%2-1)"
    [junit] -:Y 0:N +:N abs.c:25.4-16 "a=abs(y%2-2)"
    [junit] 
    [junit] +: argument > 0
    [junit] -: argument < 0
    [junit] 0: argument = 0
    [junit] Y: at least one
    [junit] N: never
    [junit] ?: unknown
    [junit] 
    [junit] === Command ===
    [junit] civl verify -analyze_abs=true -showUnreached=false examples/analysis/abs.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 2.15
    [junit]    memory (bytes)      : 220725248
    [junit]    max process count   : 1
    [junit]    states              : 169
    [junit]    states saved        : 100
    [junit]    state matches       : 0
    [junit]    transitions         : 168
    [junit]    trace steps         : 85
    [junit]    valid calls         : 425
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 253
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === abs call analysis ===
    [junit] -:? 0:N +:? abs2.c:34.11-17 "abs(v)"
    [junit] -:? 0:N +:? abs2.c:30.11-17 "abs(v)"
    [junit] -:Y 0:? +:Y abs2.c:14.11-17 "abs(v)"
    [junit] -:? 0:? +:? abs2.c:18.11-17 "abs(v)"
    [junit] -:? 0:? +:? abs2.c:22.11-17 "abs(v)"
    [junit] -:? 0:? +:? abs2.c:38.11-17 "abs(v)"
    [junit] -:? 0:? +:? abs2.c:26.11-17 "abs(v)"
    [junit] 
    [junit] +: argument > 0
    [junit] -: argument < 0
    [junit] 0: argument = 0
    [junit] Y: at least one
    [junit] N: never
    [junit] ?: unknown
    [junit] 
    [junit] === Command ===
    [junit] civl verify -analyze_abs=true -showUnreached=false examples/analysis/abs2.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 2.27
    [junit]    memory (bytes)      : 220725248
    [junit]    max process count   : 1
    [junit]    states              : 553
    [junit]    states saved        : 277
    [junit]    state matches       : 0
    [junit]    transitions         : 552
    [junit]    trace steps         : 267
    [junit]    valid calls         : 988
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 367
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.ArithmeticTest
    [junit] Tests run: 23, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 7.994 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/derivative.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.18
    [junit]    memory (bytes)      : 220725248
    [junit]    max process count   : 1
    [junit]    states              : 76
    [junit]    states saved        : 34
    [junit]    state matches       : 0
    [junit]    transitions         : 75
    [junit]    trace steps         : 28
    [junit]    valid calls         : 138
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 11
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputBOUND=3 examples/arithmetic/matmat.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.57
    [junit]    memory (bytes)      : 356515840
    [junit]    max process count   : 1
    [junit]    states              : 12306
    [junit]    states saved        : 7044
    [junit]    state matches       : 0
    [junit]    transitions         : 12305
    [junit]    trace steps         : 6901
    [junit]    valid calls         : 10825
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 46
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/algebra.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 356515840
    [junit]    max process count   : 1
    [junit]    states              : 16
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 15
    [junit]    trace steps         : 1
    [junit]    valid calls         : 4
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 1:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DIVISION_BY_ZERO, certainty: PROVEABLE) 
    [junit] at divisionBad.cvl:12.13-16 "x/y":
    [junit] Division by zero
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at divisionBad.cvl:12.2-16 "double z = x/y"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/divisionBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/divisionBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 356515840
    [junit]    max process count   : 0
    [junit]    states              : 2
    [junit]    states saved        : 1
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 0
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/divisionBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at sqrtBad1.cvl:11.2-18 "assert(y >= 1.1)":
    [junit] 
    [junit] Input variables:
    [junit] x=X0
    [junit] 
    [junit] Context: 0==SQRT(X0)
    [junit] 
    [junit] Assertion: assert((1.1<=y))
    [junit] -> 11/10<=SQRT(X0)+1
    [junit] -> 0<=SQRT(X0)+-1/10
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at sqrtBad1.cvl:11.2-8 "assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/sqrtBad1_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/sqrtBad1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.78
    [junit]    memory (bytes)      : 356515840
    [junit]    max process count   : 1
    [junit]    states              : 9
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 10
    [junit]    trace steps         : 2
    [junit]    valid calls         : 11
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 4
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/sqrtBad1_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Argument x should be greater than 0.
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at math.cvl:907.2-57 "$assert(x >= 0,  ... )":
    [junit] 
    [junit] Input variables:
    [junit] x=X0
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((0.0<=x), &((_anon_0)[0]))
    [junit] -> 0<=X0
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   sqrt at math.cvl:907.2-9 "$assert" called from
    [junit]   _CIVL_system at sqrtBad2.cvl:7.13-17 "sqrt"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/sqrtBad2_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/sqrtBad2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.52
    [junit]    memory (bytes)      : 356515840
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 2
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/sqrtBad2_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 4:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at sqrtBad1.cvl:11.2-18 "assert(y >= 1.1)":
    [junit] 
    [junit] Input variables:
    [junit] x=X0
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: assert((1.1<=y))
    [junit] -> 11/10<=1
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at sqrtBad1.cvl:11.2-8 "assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/sqrtBad1_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -DMATH_ELABORATE_ASSUMPTIONS examples/arithmetic/sqrtBad1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.49
    [junit]    memory (bytes)      : 359661568
    [junit]    max process count   : 1
    [junit]    states              : 9
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 10
    [junit]    trace steps         : 3
    [junit]    valid calls         : 11
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/sqrtBad1_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/laplace.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.13
    [junit]    memory (bytes)      : 359661568
    [junit]    max process count   : 1
    [junit]    states              : 193
    [junit]    states saved        : 46
    [junit]    state matches       : 0
    [junit]    transitions         : 192
    [junit]    trace steps         : 45
    [junit]    valid calls         : 158
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 7
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Running random simulation with seed 1436761154465 ...
    [junit] Error 0:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DIVISION_BY_ZERO, certainty: PROVEABLE) 
    [junit] at div0.cvl:3.10-13 "1/0":
    [junit] Division by zero
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at div0.cvl:3.2-13 "int x = 1/0"
    [junit] 
    [junit] Trace ends after 1 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] === Command ===
    [junit] civl run examples/arithmetic/div0.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 359661568
    [junit]    max process count   : 0
    [junit]    states              : 1
    [junit]    states Saved        : 1
    [junit]    seed                : 1436761154465
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] verify -echo examples/arithmetic/mathematical.cvl 
    [junit] 
    [junit] y=1
    [junit] z=1
    [junit] 
    [junit] === Command ===
    [junit] civl verify -echo examples/arithmetic/mathematical.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.64
    [junit]    memory (bytes)      : 359661568
    [junit]    max process count   : 1
    [junit]    states              : 16
    [junit]    states saved        : 8
    [junit]    state matches       : 0
    [junit]    transitions         : 15
    [junit]    trace steps         : 5
    [junit]    valid calls         : 18
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 6
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=10 examples/arithmetic/mean.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.24
    [junit]    memory (bytes)      : 359661568
    [junit]    max process count   : 1
    [junit]    states              : 263
    [junit]    states saved        : 172
    [junit]    state matches       : 0
    [junit]    transitions         : 262
    [junit]    trace steps         : 153
    [junit]    valid calls         : 289
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 37
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/sqrt.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.62
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 51
    [junit]    states saved        : 21
    [junit]    state matches       : 0
    [junit]    transitions         : 50
    [junit]    trace steps         : 18
    [junit]    valid calls         : 19
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 7
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=10 examples/arithmetic/assoc.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.17
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 74
    [junit]    states saved        : 57
    [junit]    state matches       : 0
    [junit]    transitions         : 73
    [junit]    trace steps         : 37
    [junit]    valid calls         : 132
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 38
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/division.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 7
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 6
    [junit]    trace steps         : 1
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 297:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at matmatBad.cvl:68.6-35 "$assert((C[i][j ... )":
    [junit] 
    [junit] Input variables:
    [junit] BOUND=3
    [junit] L=3
    [junit] M=3
    [junit] N=3
    [junit] TILE_SIZE=2
    [junit] A=(real[3][3])X4
    [junit] B=(real[3][3])X5
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((((C)[i])[j]==((D)[i])[j]))
    [junit] -> X4[0][1]*X5[1][0]+X4[0][2]*X5[2][0]+X4[0][0]*X5[0][0]==X4[0][1]*X5[1][0]+X4[0][0]*X5[0][0]
    [junit] -> 0==X4[0][2]*X5[2][0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at matmatBad.cvl:68.6-13 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/matmatBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputBOUND=3 examples/arithmetic/matmatBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.32
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 529
    [junit]    states saved        : 305
    [junit]    state matches       : 0
    [junit]    transitions         : 529
    [junit]    trace steps         : 296
    [junit]    valid calls         : 488
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 42
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/matmatBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 45:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=10
    [junit] a=(real[10])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/10*X1[1]+1/10*X1[2]+1/10*X1[3]+1/10*X1[4]+1/10*X1[5]+1/10*X1[6]+1/10*X1[7]+1/10*X1[8]+1/10*X1[9]+1/10*X1[0]==1/10*X1[9]
    [junit] -> 0==X1[1]+X1[2]+X1[3]+X1[4]+X1[5]+X1[6]+X1[7]+X1[8]+X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/meanBad_0.trace
    [junit] Restricting search depth to 44
    [junit] 
    [junit] Violation 1 encountered at depth 41:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=9
    [junit] a=(real[9])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/9*X1[1]+1/9*X1[2]+1/9*X1[3]+1/9*X1[4]+1/9*X1[5]+1/9*X1[6]+1/9*X1[7]+1/9*X1[8]+1/9*X1[0]==1/9*X1[8]
    [junit] -> 0==X1[1]+X1[2]+X1[3]+X1[4]+X1[5]+X1[6]+X1[7]+X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (41) is less than length of old (45): replacing old with new...
    [junit] Restricting search depth to 40
    [junit] 
    [junit] Violation 2 encountered at depth 37:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=8
    [junit] a=(real[8])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/8*X1[1]+1/8*X1[2]+1/8*X1[3]+1/8*X1[4]+1/8*X1[5]+1/8*X1[6]+1/8*X1[7]+1/8*X1[0]==1/8*X1[7]
    [junit] -> 0==X1[1]+X1[2]+X1[3]+X1[4]+X1[5]+X1[6]+X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (37) is less than length of old (41): replacing old with new...
    [junit] Restricting search depth to 36
    [junit] 
    [junit] Violation 3 encountered at depth 33:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=7
    [junit] a=(real[7])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/7*X1[1]+1/7*X1[2]+1/7*X1[3]+1/7*X1[4]+1/7*X1[5]+1/7*X1[6]+1/7*X1[0]==1/7*X1[6]
    [junit] -> 0==X1[1]+X1[2]+X1[3]+X1[4]+X1[5]+X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (33) is less than length of old (37): replacing old with new...
    [junit] Restricting search depth to 32
    [junit] 
    [junit] Violation 4 encountered at depth 29:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=6
    [junit] a=(real[6])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/6*X1[1]+1/6*X1[2]+1/6*X1[3]+1/6*X1[4]+1/6*X1[5]+1/6*X1[0]==1/6*X1[5]
    [junit] -> 0==X1[1]+X1[2]+X1[3]+X1[4]+X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (29) is less than length of old (33): replacing old with new...
    [junit] Restricting search depth to 28
    [junit] 
    [junit] Violation 5 encountered at depth 25:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=5
    [junit] a=(real[5])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/5*X1[1]+1/5*X1[2]+1/5*X1[3]+1/5*X1[4]+1/5*X1[0]==1/5*X1[4]
    [junit] -> 0==X1[1]+X1[2]+X1[3]+X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (25) is less than length of old (29): replacing old with new...
    [junit] Restricting search depth to 24
    [junit] 
    [junit] Violation 6 encountered at depth 21:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=4
    [junit] a=(real[4])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/4*X1[1]+1/4*X1[2]+1/4*X1[3]+1/4*X1[0]==1/4*X1[3]
    [junit] -> 0==X1[1]+X1[2]+X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (21) is less than length of old (25): replacing old with new...
    [junit] Restricting search depth to 20
    [junit] 
    [junit] Violation 7 encountered at depth 17:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=3
    [junit] a=(real[3])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/3*X1[1]+1/3*X1[2]+1/3*X1[0]==1/3*X1[2]
    [junit] -> 0==X1[1]+X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (17) is less than length of old (21): replacing old with new...
    [junit] Restricting search depth to 16
    [junit] 
    [junit] Violation 8 encountered at depth 13:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at meanBad.cvl:30.2-29 "$assert((result1==result2))":
    [junit] 
    [junit] Input variables:
    [junit] B=10
    [junit] n=2
    [junit] a=(real[2])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((result1==result2))
    [junit] -> 1/2*X1[1]+1/2*X1[0]==1/2*X1[1]
    [junit] -> 0==X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at meanBad.cvl:30.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (13) is less than length of old (17): replacing old with new...
    [junit] Restricting search depth to 12
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=10 -min examples/arithmetic/meanBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.35
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 263
    [junit]    states saved        : 172
    [junit]    state matches       : 0
    [junit]    transitions         : 262
    [junit]    trace steps         : 153
    [junit]    valid calls         : 307
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 55
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/meanBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/diffusion.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 71
    [junit]    states saved        : 37
    [junit]    state matches       : 0
    [junit]    transitions         : 70
    [junit]    trace steps         : 36
    [junit]    valid calls         : 8
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -DMATH_ELABORATE_ASSUMPTIONS examples/arithmetic/sqrt.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.51
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 59
    [junit]    states saved        : 26
    [junit]    state matches       : 0
    [junit]    transitions         : 58
    [junit]    trace steps         : 22
    [junit]    valid calls         : 27
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 6
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/quadratic1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.09
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 8
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 7
    [junit]    trace steps         : 1
    [junit]    valid calls         : 11
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 9
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] X=(X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8)/(X5*X6*X7), Y=(-1*(((X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X5*X6*X7))*X5*X6*X7)+X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8)/(X6*X7), Z=(-1*(((X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X5*X6*X7))*X5*X6*X7)+X0*X5*X6*X7+-1*(((-1*(((X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X5*X6*X7))*X5*X6*X7)+X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X6*X7))*X6*X7)+X1*X6*X7+X2*X7+X3+X8)/X7, W=-1*(((X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X5*X6*X7))*X5*X6*X7)+X0*X5*X6*X7+-1*(((-1*(((X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X5*X6*X7))*X5*X6*X7)+X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X6*X7))*X6*X7)+X1*X6*X7+-1*(((-1*(((X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X5*X6*X7))*X5*X6*X7)+X0*X5*X6*X7+-1*(((-1*(((X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X5*X6*X7))*X5*X6*X7)+X0*X5*X6*X7+X1*X6*X7+X2*X7+X3+X8) div (X6*X7))*X6*X7)+X1*X6*X7+X2*X7+X3+X8) div X7)*X7)+X2*X7+X3+X8
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/arithmetic/quadratic2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.46
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 35
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 34
    [junit]    trace steps         : 2
    [junit]    valid calls         : 40
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 30
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Argument x should be greater than 0.
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at math.cvl:907.2-57 "$assert(x >= 0,  ... )":
    [junit] 
    [junit] Input variables:
    [junit] x=X0
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((0.0<=x), &((_anon_0)[0]))
    [junit] -> 0<=X0
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   sqrt at math.cvl:907.2-9 "$assert" called from
    [junit]   _CIVL_system at sqrtBad2.cvl:7.13-17 "sqrt"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/sqrtBad2_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -DMATH_ELABORATE_ASSUMPTIONS examples/arithmetic/sqrtBad2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.17
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 2
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/sqrtBad2_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 17:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at sqrt.cvl:12.4-21 "$assert((y == 1))":
    [junit] 
    [junit] Input variables:
    [junit] CIVL_argc=X0
    [junit] CIVL_argv=(CHAR[10][])X1
    [junit] x=X2
    [junit] 
    [junit] Context: 0<=-1*X0+9 && 0<=X0+-1
    [junit] 
    [junit] Assertion: $assert((y==1.0))
    [junit] -> SQRT(X2)+1==1
    [junit] -> 0==SQRT(X2)
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _main at sqrt.cvl:12.4-11 "$assert" called from
    [junit]   _CIVL_system at GeneralTransformer:0.-1-20 "CIVL_argc, &_argv[..." inserted by GeneralTransformer.new main function before sqrt.cvl:8.13-17 "argc"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/sqrt_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -DMATH_NO_ASSUMPTIONS examples/arithmetic/sqrt.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.29
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 46
    [junit]    states saved        : 18
    [junit]    state matches       : 0
    [junit]    transitions         : 47
    [junit]    trace steps         : 16
    [junit]    valid calls         : 16
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 7
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/sqrt_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] verify -echo examples/arithmetic/multiplicationInLoopCondition.cvl 
    [junit] 
    [junit] 
    [junit] === Command ===
    [junit] civl verify -echo examples/arithmetic/multiplicationInLoopCondition.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.21
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 1
    [junit]    states              : 30
    [junit]    states saved        : 20
    [junit]    state matches       : 0
    [junit]    transitions         : 29
    [junit]    trace steps         : 15
    [junit]    valid calls         : 51
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 38
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.BackendTest
    [junit] Tests run: 3, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 0.605 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] ===================The program after linking and applying transformer is:===================
    [junit] //======================== civlc.cvh =======================
    [junit] typedef struct $proc $proc;
    [junit] typedef struct $scope $scope;
    [junit] void $wait($proc p);
    [junit] void $assert(_Bool expr, ...);
    [junit] void* $malloc($scope s, int size);
    [junit] void $free(void* p);
    [junit] int $next_time_count(void);
    [junit] void $wait($proc p);
    [junit] void $assert(_Bool expr, ...);
    [junit] void* $malloc($scope s, int size);
    [junit] void $free(void* p);
    [junit] int $next_time_count(void);
    [junit] //====================== showTrans.cvl =====================
    [junit] $abstract int random(int x, int y);
    [junit] typedef struct point{
    [junit]     int x;
    [junit]     int y;
    [junit] } point_t;
    [junit] int times2(int k, int t)
    [junit] {
    [junit]   return (2 * k) * t;
    [junit] }
    [junit] void f()
    [junit] {
    [junit]   $atomic
    [junit]   {
    [junit]     int x = 0;
    [junit]     x = x + 1;
    [junit]   }
    [junit] }
    [junit] point_t reverse(point_t old)
    [junit] {
    [junit]   point_t new;
    [junit]   new.x = old.y;
    [junit]   new.y = old.x;
    [junit]   return new;
    [junit] }
    [junit] void main()
    [junit] {
    [junit]   int a = 2;
    [junit]   int* b = &a;
    [junit]    (void (void))* g = &f;
    [junit]   $proc p = $spawn g();
    [junit]   int  c[2][2];
    [junit]   $domain(2) dom = ($domain(2)){1 .. 4 # 2, 1 .. 4 # 2};
    [junit]   point_t pt;
    [junit]   double db;
    [junit]   int $sef$2;
    [junit]   if(a > 0)
    [junit]   {
    [junit]     int $sef$0 = times2(3, a * 5);
    [junit]     $sef$2 = $sef$0;
    [junit]   }
    [junit]   else
    [junit]   {
    [junit]     int $sef$1 = times2(a, a + 6);
    [junit]     $sef$2 = $sef$1;
    [junit]   }
    [junit]   a = $sef$2;
    [junit]   db = (double)a;
    [junit]   pt.x = 1;
    [junit]   pt.y = pt.x + 5;
    [junit]   struct point $sef$3 = reverse(pt);
    [junit]   pt.x = $sef$3.x;
    [junit]   $wait(p);
    [junit]   p = $spawn g();
    [junit]   $wait(p);
    [junit]   a = random(a, a + 2);
    [junit]   a = times2(a * a, a);
    [junit]   a = $next_time_count();
    [junit]   *b = $next_time_count();
    [junit]   a = -(a + ((*b) * 6));
    [junit]   $for(int i, j: dom)
    [junit]     c[(i - 1) / 2][(j - 1) / 2] = (i * 10) + j;
    [junit]   $assert($forall {int i | (i >= 0) && (i < 2)} (c[i][i]) >= 0);
    [junit]   $assert($exists {int i | (i >= 0) && (i < 2)} (c[i][i]) >= 0);
    [junit]   dom = ($domain(2)){0 .. 1, 0 .. 1};
    [junit]   $parfor(int i, j: dom)
    [junit]     times2(i, j);
    [junit]   *b = *(&c[0][0]) + 1;
    [junit]   b = (int*)($malloc($root, sizeof(int) * 2));
    [junit]   b[0] = c[0][0];
    [junit]   b[1] = c[1][1];
    [junit]   $free(b);
    [junit] }
    [junit] 
    [junit] State 0, p0:
    [junit]   0->1: a=2 at showTrans.cvl:31.2-9 "int a=2"
    [junit] --> State 1
    [junit] State 1, p0:
    [junit]   1->2: b=&<d1>a at showTrans.cvl:32.2-11 "int *b=&a"
    [junit]   2->3: g=f [g:=&<d0>f()] at showTrans.cvl:33.2-20 "void (*g)(void) ... f"
    [junit]   3->4: p=$spawn f() [p:=p1] at showTrans.cvl:34.2-20 "$proc p=$spawn g()"
    [junit]   4->5: c=InitialValue(c) [c:=(int[2][2])X_s1v5p0] at showTrans.cvl:35.2-13 "int c[2][2]"
    [junit]   5->6: dom=($domain){2, 0, ($regular_range[2]){{1, 4, 2}, {1, 4, 2}}} at showTrans.cvl:36.2-49 "$domain(2) dom=($domain ... }"
    [junit]   6->7: pt=InitialValue(pt) [pt:=(point)X_s1v7p0] at showTrans.cvl:37.2-12 "point_t pt"
    [junit] --> State 2
    [junit] State 2, p0:
    [junit]   7->8: TRUE_BRANCH_IF at showTrans.cvl:40.4-5 "a"
    [junit] --> State 3
    [junit] State 3, p0:
    [junit]   8->40: $sef$0=times2(3, 2*5) at showTrans.cvl:40.8-22 "times2(3, a*5)"
    [junit] --> State 4
    [junit] State 4, p0:
    [junit]   40->RET: times2(...) return (2*3)*10 [$sef$0:=60] at showTrans.cvl:11.2-15 "return 2*k*t;"
    [junit]   9->10: $sef$2=60 at showTrans.cvl:40.4-37 "a>0?times2(3,  ... )"
    [junit] --> State 5
    [junit] State 5, p0:
    [junit]   10->11: a=60 at showTrans.cvl:40.2-37 "a=a>0?times2(3 ... )"
    [junit] --> State 6
    [junit] State 6, p0:
    [junit]   11->12: db=($real)60 [db:=60] at showTrans.cvl:41.2-14 "db=(double)a"
    [junit]   12->13: (pt).x=1 at showTrans.cvl:42.2-8 "pt.x=1"
    [junit]   13->14: (pt).y=1+5 [(pt).y:=6] at showTrans.cvl:43.2-13 "pt.y=pt.x+5"
    [junit]   14->46: $sef$3=reverse((point){1, 6}) at showTrans.cvl:44.7-18 "reverse(pt)"
    [junit] --> State 7
    [junit] State 7, p0:
    [junit]   46->47: new=InitialValue(new) [new:=(point)X_s2v1p0] at showTrans.cvl:23.2-13 "point_t new"
    [junit]   47->48: (new).x=6 at showTrans.cvl:25.2-13 "new.x=old.y"
    [junit]   48->49: (new).y=1 at showTrans.cvl:26.2-13 "new.y=old.x"
    [junit]   49->RET: reverse(...) return (point){6, 1} [$sef$3:=(point){6, 1}] at showTrans.cvl:27.2-13 "return new;"
    [junit]   15->16: (pt).x=6 at showTrans.cvl:44.2-20 "pt.x=reverse(pt).x"
    [junit] --> State 8
    [junit] State 8, p1:
    [junit]   41->42: ENTER_ATOMIC (_atomic_lock_var = $self, atomicCount++) at showTrans.cvl:15.2-9 "$atomic"
    [junit]   42->43: x=0 at showTrans.cvl:16.2-9 "int x=0"
    [junit]   43->44: x=0+1 [x:=1] at showTrans.cvl:18.2-5 "x++"
    [junit]   44->45: LEAVE_ATOMIC (_atomic_lock_var = process<-1>, atomicCount--) at showTrans.cvl:19.2-3 "}"
    [junit]   45->RET: f(...) return at showTrans.cvl:20.0-1 "}"
    [junit] --> State 9
    [junit] State 9, p0:
    [junit]   16->17: $wait(p1) at showTrans.cvl:45.2-10 "$wait(p)"
    [junit]   17->18: p=$spawn f() [p:=p2] at showTrans.cvl:46.2-14 "p=$spawn g()"
    [junit] --> State 10
    [junit] State 10, p1:
    [junit]   41->42: ENTER_ATOMIC (_atomic_lock_var = $self, atomicCount++) at showTrans.cvl:15.2-9 "$atomic"
    [junit]   42->43: x=0 at showTrans.cvl:16.2-9 "int x=0"
    [junit]   43->44: x=0+1 [x:=1] at showTrans.cvl:18.2-5 "x++"
    [junit]   44->45: LEAVE_ATOMIC (_atomic_lock_var = process<-1>, atomicCount--) at showTrans.cvl:19.2-3 "}"
    [junit]   45->RET: f(...) return at showTrans.cvl:20.0-1 "}"
    [junit] --> State 11
    [junit] State 11, p0:
    [junit]   18->19: $wait(p1) at showTrans.cvl:47.2-10 "$wait(p)"
    [junit] --> State 12
    [junit] State 12, p0:
    [junit]   19->20: a=random(60, (60+2)) [a:=random(60,62)] at showTrans.cvl:48.2-18 "a=random(a, a+ ... )"
    [junit] --> State 13
    [junit] State 13, p0:
    [junit]   20->40: a=times2(random(60,62)*random(60,62), random(60,62)) at showTrans.cvl:49.2-18 "a=times2(a*a,  ... )"
    [junit] --> State 14
    [junit] State 14, p0:
    [junit]   40->RET: times2(...) return (2*random(60,62)^2)*random(60,62) [a:=2*(random(60,62)^3)] at showTrans.cvl:11.2-15 "return 2*k*t;"
    [junit] --> State 15
    [junit] State 15, p0:
    [junit]   21->22: a=$next_time_count() [a:=0] at showTrans.cvl:50.2-22 "a=$next_time_count()"
    [junit] --> State 16
    [junit] State 16, p0:
    [junit]   22->23: *(&<d1>a)=$next_time_count() [*(&<d1>a):=1] at showTrans.cvl:51.2-23 "*b=$next_time_count()"
    [junit] --> State 17
    [junit] State 17, p0:
    [junit]   23->24: a=-(1+(*&<d1>a*6)) [a:=-7] at showTrans.cvl:52.2-13 "a=-(a+*b* ... )"
    [junit] --> State 18
    [junit] State 18, p0:
    [junit]   24->25: LOOP_BODY_ENTER at showTrans.cvl:53.17-20 "dom"
    [junit]   25->26: $for((NULL, NULL) has next in ($domain){2, 0, ($regular_range[2]){{1, 4, 2}, {1, 4, 2}}} at showTrans.cvl:53.2-6 "$for"
    [junit] --> State 19
    [junit] State 19, p0:
    [junit]   26->24: c[0][0]=(1*10)+1 [c[0][0]:=11] at showTrans.cvl:54.4-34 "c[(i-1)/2 ... j"
    [junit] --> State 20
    [junit] State 20, p0:
    [junit]   24->25: LOOP_BODY_ENTER at showTrans.cvl:53.17-20 "dom"
    [junit]   25->26: $for((1, 1) has next in ($domain){2, 0, ($regular_range[2]){{1, 4, 2}, {1, 4, 2}}} at showTrans.cvl:53.2-6 "$for"
    [junit] --> State 21
    [junit] State 21, p0:
    [junit]   26->24: c[0][1]=(1*10)+3 [c[0][1]:=13] at showTrans.cvl:54.4-34 "c[(i-1)/2 ... j"
    [junit] --> State 22
    [junit] State 22, p0:
    [junit]   24->25: LOOP_BODY_ENTER at showTrans.cvl:53.17-20 "dom"
    [junit]   25->26: $for((1, 3) has next in ($domain){2, 0, ($regular_range[2]){{1, 4, 2}, {1, 4, 2}}} at showTrans.cvl:53.2-6 "$for"
    [junit] --> State 23
    [junit] State 23, p0:
    [junit]   26->24: c[1][0]=(3*10)+1 [c[1][0]:=31] at showTrans.cvl:54.4-34 "c[(i-1)/2 ... j"
    [junit] --> State 24
    [junit] State 24, p0:
    [junit]   24->25: LOOP_BODY_ENTER at showTrans.cvl:53.17-20 "dom"
    [junit]   25->26: $for((3, 1) has next in ($domain){2, 0, ($regular_range[2]){{1, 4, 2}, {1, 4, 2}}} at showTrans.cvl:53.2-6 "$for"
    [junit] --> State 25
    [junit] State 25, p0:
    [junit]   26->24: c[1][1]=(3*10)+3 [c[1][1]:=33] at showTrans.cvl:54.4-34 "c[(i-1)/2 ... j"
    [junit] --> State 26
    [junit] State 26, p0:
    [junit]   24->27: LOOP_BODY_EXIT at showTrans.cvl:53.17-20 "dom"
    [junit]   27->28: $assert(FORALL {int i | ((0<=i)&&(i<2))} (0<=((c)[i])[i])) at showTrans.cvl:55.2-57 "$assert($forall {int i  ... )"
    [junit]   28->29: $assert(EXISTS {int i | ((0<=i)&&(i<2))} (0<=((c)[i])[i])) at showTrans.cvl:56.2-57 "$assert($exists {int i  ... )"
    [junit]   29->30: dom=($domain){2, 0, ($regular_range[2]){{0, 1, 1}, {0, 1, 1}}} at showTrans.cvl:57.2-34 "dom=($domain(2)){ ... }"
    [junit]   30->31: $parfor(i0,i1: ($domain){2, 0, ($regular_range[2]){{0, 1, 1}, {0, 1, 1}}}) $spawn times2(i0,i1) at showTrans.cvl:58.2-9 "$parfor"
    [junit] --> State 27
    [junit] State 27, p3:
    [junit]   40->RET: times2(...) return (2*0)*0 at showTrans.cvl:11.2-15 "return 2*k*t;"
    [junit] --> State 28
    [junit] State 28, p4:
    [junit]   40->RET: times2(...) return (2*0)*1 at showTrans.cvl:11.2-15 "return 2*k*t;"
    [junit] --> State 29
    [junit] State 29, p5:
    [junit]   40->RET: times2(...) return (2*1)*0 at showTrans.cvl:11.2-15 "return 2*k*t;"
    [junit] --> State 30
    [junit] State 30, p6:
    [junit]   40->RET: times2(...) return (2*1)*1 at showTrans.cvl:11.2-15 "return 2*k*t;"
    [junit] --> State 31
    [junit] State 31, p0:
    [junit]   31->32: $waitall(&<d1>_par_procs0[0], 4) at showTrans.cvl:59.16-17 ";"
    [junit] --> State 32
    [junit] State 32, p0:
    [junit]   32->33: *(&<d1>a)=*(&<d1>c[0][0]+1) [*(&<d1>a):=13] at showTrans.cvl:60.2-18 "*b=*(&c[0 ... )"
    [junit] --> State 33
    [junit] State 33, p0:
    [junit]   33->34: b=(int*)$malloc(d0, SIZEOF_INT*2) [b:=&<d0>heap.malloc0[0][0]] at showTrans.cvl:61.2-39 "b=(int*)$malloc($root ... )"
    [junit] --> State 35
    [junit] State 35, p0:
    [junit]   34->35: *(&<d0>heap.malloc0[0][0]+0)=11 at showTrans.cvl:62.2-14 "b[0]=c[0] ... ]"
    [junit] --> State 36
    [junit] State 36, p0:
    [junit]   35->36: *(&<d0>heap.malloc0[0][0]+1)=33 at showTrans.cvl:63.2-14 "b[1]=c[1] ... ]"
    [junit] --> State 37
    [junit] State 37, p0:
    [junit]   36->37: $free(&<d0>heap.malloc0[0][0]) at showTrans.cvl:64.2-10 "$free(b)"
    [junit]   37->RET: _CIVL_system(...) return at showTrans.cvl:65.0-1 "}"
    [junit] --> State 38
    [junit] 
    [junit] === Command ===
    [junit] civl verify -showProgram -showTransitions examples/backend/showTrans.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.19
    [junit]    memory (bytes)      : 613416960
    [junit]    max process count   : 5
    [junit]    states              : 69
    [junit]    states saved        : 39
    [junit]    state matches       : 0
    [junit]    transitions         : 68
    [junit]    trace steps         : 37
    [junit]    valid calls         : 201
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 6
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] State 0, p0:
    [junit]   0->1: x=InitialValue(x) [x:=X0] at printExpr.cvl:19.0-12 "$input int x"
    [junit]   1->2: y=InitialValue(y) [y:=X1] at printExpr.cvl:20.0-12 "$input int y"
    [junit]   2->3: MU=InitialValue(MU) [MU:=X2] at printExpr.cvl:21.0-17 "$input MyUnion MU"
    [junit]   3->4: dx=InitialValue(dx) [dx:=X3] at printExpr.cvl:22.0-16 "$input double dx"
    [junit]   4->5: dy=InitialValue(dy) [dy:=X4] at printExpr.cvl:23.0-16 "$input double dy"
    [junit]   5->6: _A=InitialValue(_A) [_A:=(int[])X5] at printExpr.cvl:24.0-15 "$input int _A[]"
    [junit]   6->7: B=InitialValue(B) [B:=X6] at printExpr.cvl:25.0-14 "$input _Bool B"
    [junit]   7->8: p=InitialValue(p) [p:=X7] at printExpr.cvl:26.0-14 "$input $proc p"
    [junit]   8->9: pt=InitialValue(pt) [pt:=(Point)X8] at printExpr.cvl:27.0-15 "$input Point pt"
    [junit]   9->10: $assume(X7!=$self) at printExpr.cvl:28.0-19 "$assume(p != $self)"
    [junit]   10->11: sc=InitialValue(sc) [sc:=X9] at printExpr.cvl:29.0-16 "$input $scope sc"
    [junit]   11->12: $assume(X9!=d0) at printExpr.cvl:30.0-20 "$assume(sc != $root)"
    [junit]   12->13: $assume(X3!=0) at printExpr.cvl:31.0-14 "$assume(dx!=0)"
    [junit]   13->14: p1=InitialValue(p1) [p1:=$proc_null] at printExpr.cvl:32.0-8 "$proc p1"
    [junit]   14->15: k=sum [k:=&<d0>sum(n : int)] at printExpr.cvl:62.2-20 "int (*k)(int) ... sum"
    [junit]   15->16: A=InitialValue(A) [A:=(int[10])X_s1v2p0] at printExpr.cvl:63.2-11 "int A[10]"
    [junit]   16->17: mu=InitialValue(mu) [mu:=X_s1v20p0] at printExpr.cvl:69.2-12 "MyUnion mu"
    [junit] --> State 1
    [junit] 
    [junit] State 1
    [junit] | Path condition
    [junit] | | (0 != X7.0) && (0 != X9.0) && (0 != X3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])X_s1v2p0
    [junit] | | | | p = NULL
    [junit] | | | | n = NULL
    [junit] | | | | n1 = NULL
    [junit] | | | | n2 = NULL
    [junit] | | | | n3 = NULL
    [junit] | | | | n4 = NULL
    [junit] | | | | n5 = NULL
    [junit] | | | | n6 = NULL
    [junit] | | | | n7 = NULL
    [junit] | | | | n8 = NULL
    [junit] | | | | n9 = NULL
    [junit] | | | | b = NULL
    [junit] | | | | b1 = NULL
    [junit] | | | | b2 = NULL
    [junit] | | | | b3 = NULL
    [junit] | | | | d1 = NULL
    [junit] | | | | d2 = NULL
    [junit] | | | | mu = X_s1v20p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=17, printExpr.cvl:71.2-6 "A[1]", dyscope=d1]
    [junit] State 1, p0:
    [junit]   17->18: A[1]=8 at printExpr.cvl:71.2-8 "A[1]=8"
    [junit] --> State 2
    [junit] 
    [junit] State 2
    [junit] | Path condition
    [junit] | | (0 != X7.0) && (0 != X9.0) && (0 != X3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])(X_s1v2p0){[1]=8}
    [junit] | | | | p = NULL
    [junit] | | | | n = NULL
    [junit] | | | | n1 = NULL
    [junit] | | | | n2 = NULL
    [junit] | | | | n3 = NULL
    [junit] | | | | n4 = NULL
    [junit] | | | | n5 = NULL
    [junit] | | | | n6 = NULL
    [junit] | | | | n7 = NULL
    [junit] | | | | n8 = NULL
    [junit] | | | | n9 = NULL
    [junit] | | | | b = NULL
    [junit] | | | | b1 = NULL
    [junit] | | | | b2 = NULL
    [junit] | | | | b3 = NULL
    [junit] | | | | d1 = NULL
    [junit] | | | | d2 = NULL
    [junit] | | | | mu = X_s1v20p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=18, printExpr.cvl:72.2-6 "A[2]", dyscope=d1]
    [junit] State 2, p0:
    [junit]   18->19: A[2]=9 at printExpr.cvl:72.2-8 "A[2]=9"
    [junit] --> State 3
    [junit] 
    [junit] State 3
    [junit] | Path condition
    [junit] | | (0 != X7.0) && (0 != X9.0) && (0 != X3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])(X_s1v2p0){[1]=8, [2]=9}
    [junit] | | | | p = NULL
    [junit] | | | | n = NULL
    [junit] | | | | n1 = NULL
    [junit] | | | | n2 = NULL
    [junit] | | | | n3 = NULL
    [junit] | | | | n4 = NULL
    [junit] | | | | n5 = NULL
    [junit] | | | | n6 = NULL
    [junit] | | | | n7 = NULL
    [junit] | | | | n8 = NULL
    [junit] | | | | n9 = NULL
    [junit] | | | | b = NULL
    [junit] | | | | b1 = NULL
    [junit] | | | | b2 = NULL
    [junit] | | | | b3 = NULL
    [junit] | | | | d1 = NULL
    [junit] | | | | d2 = NULL
    [junit] | | | | mu = X_s1v20p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=19, printExpr.cvl:73.2-6 "A[3]", dyscope=d1]
    [junit] State 3, p0:
    [junit]   19->20: A[3]=7 at printExpr.cvl:73.2-8 "A[3]=7"
    [junit] --> State 4
    [junit] 
    [junit] State 4
    [junit] | Path condition
    [junit] | | (0 != X7.0) && (0 != X9.0) && (0 != X3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])(X_s1v2p0){[1]=8, [2]=9, [3]=7}
    [junit] | | | | p = NULL
    [junit] | | | | n = NULL
    [junit] | | | | n1 = NULL
    [junit] | | | | n2 = NULL
    [junit] | | | | n3 = NULL
    [junit] | | | | n4 = NULL
    [junit] | | | | n5 = NULL
    [junit] | | | | n6 = NULL
    [junit] | | | | n7 = NULL
    [junit] | | | | n8 = NULL
    [junit] | | | | n9 = NULL
    [junit] | | | | b = NULL
    [junit] | | | | b1 = NULL
    [junit] | | | | b2 = NULL
    [junit] | | | | b3 = NULL
    [junit] | | | | d1 = NULL
    [junit] | | | | d2 = NULL
    [junit] | | | | mu = X_s1v20p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=20, printExpr.cvl:74.2-3 "n", dyscope=d1]
    [junit] State 4, p0:
    [junit]   20->21: n=9 at printExpr.cvl:74.2-8 "n=A[2]"
    [junit]   21->22: $assume((0<=X0)&&(X0<10)) at printExpr.cvl:75.2-23 "$assume(0<=x && x ... )"
    [junit] --> State 6
    [junit] 
    [junit] State 6
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])(X_s1v2p0){[1]=8, [2]=9, [3]=7}
    [junit] | | | | p = NULL
    [junit] | | | | n = 9
    [junit] | | | | n1 = NULL
    [junit] | | | | n2 = NULL
    [junit] | | | | n3 = NULL
    [junit] | | | | n4 = NULL
    [junit] | | | | n5 = NULL
    [junit] | | | | n6 = NULL
    [junit] | | | | n7 = NULL
    [junit] | | | | n8 = NULL
    [junit] | | | | n9 = NULL
    [junit] | | | | b = NULL
    [junit] | | | | b1 = NULL
    [junit] | | | | b2 = NULL
    [junit] | | | | b3 = NULL
    [junit] | | | | d1 = NULL
    [junit] | | | | d2 = NULL
    [junit] | | | | mu = X_s1v20p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=22, printExpr.cvl:76.2-6 "A[x]", dyscope=d1]
    [junit] State 6, p0:
    [junit]   22->23: A[X0]=9 at printExpr.cvl:76.2-8 "A[x]=9"
    [junit] --> State 7
    [junit] 
    [junit] State 7
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = NULL
    [junit] | | | | n = 9
    [junit] | | | | n1 = NULL
    [junit] | | | | n2 = NULL
    [junit] | | | | n3 = NULL
    [junit] | | | | n4 = NULL
    [junit] | | | | n5 = NULL
    [junit] | | | | n6 = NULL
    [junit] | | | | n7 = NULL
    [junit] | | | | n8 = NULL
    [junit] | | | | n9 = NULL
    [junit] | | | | b = NULL
    [junit] | | | | b1 = NULL
    [junit] | | | | b2 = NULL
    [junit] | | | | b3 = NULL
    [junit] | | | | d1 = NULL
    [junit] | | | | d2 = NULL
    [junit] | | | | mu = X_s1v20p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=23, printExpr.cvl:77.2-3 "n", dyscope=d1]
    [junit] State 7, p0:
    [junit]   23->24: n=X_s1v2p0[1:=8, 2:=9, 3:=7][X0:=9][X0] at printExpr.cvl:77.2-8 "n=A[x]"
    [junit]   24->25: n=X0+X1 at printExpr.cvl:78.2-7 "n=x+y"
    [junit] --> State 8
    [junit] 
    [junit] State 8
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = NULL
    [junit] | | | | n = X0+X1
    [junit] | | | | n1 = NULL
    [junit] | | | | n2 = NULL
    [junit] | | | | n3 = NULL
    [junit] | | | | n4 = NULL
    [junit] | | | | n5 = NULL
    [junit] | | | | n6 = NULL
    [junit] | | | | n7 = NULL
    [junit] | | | | n8 = NULL
    [junit] | | | | n9 = NULL
    [junit] | | | | b = NULL
    [junit] | | | | b1 = NULL
    [junit] | | | | b2 = NULL
    [junit] | | | | b3 = NULL
    [junit] | | | | d1 = NULL
    [junit] | | | | d2 = NULL
    [junit] | | | | mu = X_s1v20p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=25, printExpr.cvl:79.4-15 "$seq_length", dyscope=d1]
    [junit] State 8, p0:
    [junit]   25->26: n=$seq_length(&<d0>_A) [n:=length(X5)] at printExpr.cvl:79.2-20 "n=$seq_length(&_A)"
    [junit]   26->27: b=(X0!=0)&&(X1!=0) [b:=0!=X0 && 0!=X1] at printExpr.cvl:80.2-12 "b = x && y"
    [junit]   27->28: b=X0<X1 [b:=0<-1*X0+X1] at printExpr.cvl:81.2-7 "b=x<y"
    [junit]   28->29: b=X0<=X1 [b:=0<=-1*X0+X1] at printExpr.cvl:82.2-8 "b=x<=y"
    [junit]   29->30: b=($bool)X0 [b:=0!=X0] at printExpr.cvl:83.2-12 "b=(_Bool)x"
    [junit]   30->31: $assume(X0!=0) at printExpr.cvl:84.2-15 "$assume(x!=0)"
    [junit]   31->32: n1=X1/X0 at printExpr.cvl:85.2-8 "n1=y/x"
    [junit]   32->33: d1=X4/X3 at printExpr.cvl:86.2-10 "d1=dy/dx"
    [junit]   33->34: n2=X1%X0 at printExpr.cvl:87.2-8 "n2=y%x"
    [junit]   34->35: n3=X0*X1 at printExpr.cvl:88.2-8 "n3=x*y"
    [junit]   35->36: n4=-X1 [n4:=-1*X1] at printExpr.cvl:89.2-7 "n4=-y"
    [junit]   36->37: b1=X0!=X1 [b1:=0!=-1*X0+X1] at printExpr.cvl:90.2-9 "b1=x!=y"
    [junit]   37->38: b2=!X6 at printExpr.cvl:91.2-7 "b2=!B"
    [junit]   38->39: b3=X6||0!=-1*X0+X1 [b3:=0!=-1*X0+X1||X6] at printExpr.cvl:92.2-13 "b3= B || b1"
    [junit]   39->40: n5=X0-X1 [n5:=X0+-1*X1] at printExpr.cvl:93.2-8 "n5=x-y"
    [junit]   40->41: b=X0==X1 [b:=0==-1*X0+X1] at printExpr.cvl:94.2-8 "b=x==y"
    [junit]   41->42: n6=(int)X8.0 [n6:=(int)(X8.0)] at printExpr.cvl:95.2-9 "n6=pt.x"
    [junit]   42->43: n7=random(length(X5)) at printExpr.cvl:96.2-14 "n7=random(n)"
    [junit]   43->44: n8=(((X0*X0)*X0)*X0)*X0 [n8:=X0^5] at printExpr.cvl:97.2-14 "n8=x*x*x*x ... x"
    [junit]   44->45: n9=extract(0,X2) at printExpr.cvl:98.2-9 "n9=MU.a"
    [junit]   45->46: d2=extract(1,X2) at printExpr.cvl:99.2-9 "d2=MU.b"
    [junit]   46->47: (mu).a=(int)(X8.0) at printExpr.cvl:100.2-9 "mu.a=n6"
    [junit]   47->55: structs() at printExpr.cvl:101.2-11 "structs()"
    [junit] --> State 10
    [junit] 
    [junit] State 10
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = NULL
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | | dyscope d3 (id=2, parent=d2, static=11)
    [junit] | | | variables
    [junit] | | | | p0 = NULL
    [junit] | | | | p1 = NULL
    [junit] | | | | p2 = NULL
    [junit] | | | | l0 = NULL
    [junit] | | | | l1 = NULL
    [junit] | | | | l2 = NULL
    [junit] | | | | lines = NULL
    [junit] | | dyscope d2 (id=3, parent=d0, static=7)
    [junit] | | | variables
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=structs, location=55, printExpr.cvl:35.14-15 "{", dyscope=d3]
    [junit] | | | | Frame[function=_CIVL_system, location=47, printExpr.cvl:101.2-9 "structs", dyscope=d1]
    [junit] State 10, p0:
    [junit]   55->56: p0=(Point){0, 0} at printExpr.cvl:36.2-30 "Point p0={0,0} ... p2"
    [junit]   56->57: p1=(Point){1, 1} at printExpr.cvl:36.2-30 "Point p0={0,0} ... p2"
    [junit]   57->58: p2=InitialValue(p2) [p2:=(Point)X_s2v3p0] at printExpr.cvl:36.2-30 "Point p0={0,0} ... p2"
    [junit]   58->59: l0=(Line){{0, 0}, {1, 1}} at printExpr.cvl:37.2-42 "Line l0={p0, p1 ... p0"
    [junit]   59->60: l1=(Line){{1, 1}, X_s2v3p0} at printExpr.cvl:37.2-42 "Line l0={p0, p1 ... p0"
    [junit]   60->61: l2=(Line){X_s2v3p0, {0, 0}} at printExpr.cvl:37.2-42 "Line l0={p0, p1 ... p0"
    [junit]   61->62: lines=InitialValue(lines) [lines:=(Line[3])X_s2v7p0] at printExpr.cvl:38.2-15 "Line lines[3]"
    [junit]   62->63: (p2).x=2 at printExpr.cvl:42.2-8 "p2.x=2"
    [junit]   63->64: (p2).y=2 at printExpr.cvl:43.2-8 "p2.y=2"
    [junit] --> State 11
    [junit] 
    [junit] State 11
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = NULL
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | | dyscope d3 (id=2, parent=d2, static=11)
    [junit] | | | variables
    [junit] | | | | p0 = (Point){.x=0, .y=0}
    [junit] | | | | p1 = (Point){.x=1, .y=1}
    [junit] | | | | p2 = (Point){.x=2, .y=2}
    [junit] | | | | l0 = (Line){
    [junit] | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | .end={.x=1, .y=1}}
    [junit] | | | | l1 = (Line){
    [junit] | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | .end=X_s2v3p0}
    [junit] | | | | l2 = (Line){
    [junit] | | | | | .start=X_s2v3p0, 
    [junit] | | | | | .end={.x=0, .y=0}}
    [junit] | | | | lines = (Line[3])X_s2v7p0
    [junit] | | dyscope d2 (id=3, parent=d0, static=7)
    [junit] | | | variables
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=structs, location=64, printExpr.cvl:44.2-10 "lines[0]", dyscope=d3]
    [junit] | | | | Frame[function=_CIVL_system, location=47, printExpr.cvl:101.2-9 "structs", dyscope=d1]
    [junit] State 11, p0:
    [junit]   64->65: lines[0]=(Line){{0, 0}, {1, 1}} at printExpr.cvl:44.2-13 "lines[0]=l0"
    [junit] --> State 12
    [junit] 
    [junit] State 12
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = NULL
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | | dyscope d3 (id=2, parent=d2, static=11)
    [junit] | | | variables
    [junit] | | | | p0 = (Point){.x=0, .y=0}
    [junit] | | | | p1 = (Point){.x=1, .y=1}
    [junit] | | | | p2 = (Point){.x=2, .y=2}
    [junit] | | | | l0 = (Line){
    [junit] | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | .end={.x=1, .y=1}}
    [junit] | | | | l1 = (Line){
    [junit] | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | .end=X_s2v3p0}
    [junit] | | | | l2 = (Line){
    [junit] | | | | | .start=X_s2v3p0, 
    [junit] | | | | | .end={.x=0, .y=0}}
    [junit] | | | | lines = (Line[3])(X_s2v7p0){
    [junit] | | | | | [0]={
    [junit] | | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | | .end={.x=1, .y=1}}}
    [junit] | | dyscope d2 (id=3, parent=d0, static=7)
    [junit] | | | variables
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=structs, location=65, printExpr.cvl:45.2-10 "lines[1]", dyscope=d3]
    [junit] | | | | Frame[function=_CIVL_system, location=47, printExpr.cvl:101.2-9 "structs", dyscope=d1]
    [junit] State 12, p0:
    [junit]   65->66: lines[1]=(Line){{1, 1}, X_s2v3p0} at printExpr.cvl:45.2-13 "lines[1]=l1"
    [junit] --> State 13
    [junit] 
    [junit] State 13
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = NULL
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | | dyscope d3 (id=2, parent=d2, static=11)
    [junit] | | | variables
    [junit] | | | | p0 = (Point){.x=0, .y=0}
    [junit] | | | | p1 = (Point){.x=1, .y=1}
    [junit] | | | | p2 = (Point){.x=2, .y=2}
    [junit] | | | | l0 = (Line){
    [junit] | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | .end={.x=1, .y=1}}
    [junit] | | | | l1 = (Line){
    [junit] | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | .end=X_s2v3p0}
    [junit] | | | | l2 = (Line){
    [junit] | | | | | .start=X_s2v3p0, 
    [junit] | | | | | .end={.x=0, .y=0}}
    [junit] | | | | lines = (Line[3])(X_s2v7p0){
    [junit] | | | | | [0]={
    [junit] | | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | | .end={.x=1, .y=1}}, 
    [junit] | | | | | [1]={
    [junit] | | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | | .end=X_s2v3p0}}
    [junit] | | dyscope d2 (id=3, parent=d0, static=7)
    [junit] | | | variables
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=structs, location=66, printExpr.cvl:46.2-10 "lines[2]", dyscope=d3]
    [junit] | | | | Frame[function=_CIVL_system, location=47, printExpr.cvl:101.2-9 "structs", dyscope=d1]
    [junit] State 13, p0:
    [junit]   66->67: lines[2]=(Line){X_s2v3p0, {0, 0}} at printExpr.cvl:46.2-13 "lines[2]=l2"
    [junit]   67->RET: structs(...) return at printExpr.cvl:47.0-1 "}"
    [junit] --> State 14
    [junit] 
    [junit] State 14
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = NULL
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=48, printExpr.cvl:102.2-3 "p", dyscope=d1]
    [junit] State 14, p0:
    [junit]   48->49: p=(int*)$malloc(d0, SIZEOF_INT*10) [p:=&<d0>heap.malloc0[0][0]] at printExpr.cvl:102.2-40 "p=(int*)$malloc($root ... )"
    [junit]   49->68: call(&<d0>sum(n : int), 2) at printExpr.cvl:103.2-12 "call(k, 2)"
    [junit] --> State 16
    [junit] 
    [junit] State 16
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0 at printExpr.cvl:102.2-40 "p=(int*)$malloc($root ... )":
    [junit] | | | | | | 0: (int[10])Hop0s0f0o0
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = &<d0>heap.malloc0[0][0]
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | | dyscope d5 (id=2, parent=d4, static=12)
    [junit] | | | variables
    [junit] | | | | $sef$0 = NULL
    [junit] | | dyscope d4 (id=3, parent=d0, static=8)
    [junit] | | | variables
    [junit] | | | | f = &<d0>sum(n : int)
    [junit] | | | | arg = 2
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=call, location=68, printExpr.cvl:50.9-10 "f", dyscope=d5]
    [junit] | | | | Frame[function=_CIVL_system, location=49, printExpr.cvl:103.2-6 "call", dyscope=d1]
    [junit] State 16, p0:
    [junit]   68->69: $sef$0=sum(2) at printExpr.cvl:50.9-15 "f(arg)"
    [junit] --> State 17
    [junit] 
    [junit] State 17
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0 at printExpr.cvl:102.2-40 "p=(int*)$malloc($root ... )":
    [junit] | | | | | | 0: (int[10])Hop0s0f0o0
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = $proc_null
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = &<d0>heap.malloc0[0][0]
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | | dyscope d5 (id=2, parent=d4, static=12)
    [junit] | | | variables
    [junit] | | | | $sef$0 = NULL
    [junit] | | dyscope d4 (id=3, parent=d0, static=8)
    [junit] | | | variables
    [junit] | | | | f = &<d0>sum(n : int)
    [junit] | | | | arg = 2
    [junit] | | dyscope d7 (id=4, parent=d6, static=13)
    [junit] | | | variables
    [junit] | | | | result = NULL
    [junit] | | dyscope d6 (id=5, parent=d0, static=9)
    [junit] | | | variables
    [junit] | | | | n = 2
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=sum, location=70, printExpr.cvl:54.2-14 "int result=0", dyscope=d7]
    [junit] | | | | Frame[function=call, location=68, printExpr.cvl:50.9-10 "f", dyscope=d5]
    [junit] | | | | Frame[function=_CIVL_system, location=49, printExpr.cvl:103.2-6 "call", dyscope=d1]
    [junit] State 17, p0:
    [junit]   70->71: result=0 at printExpr.cvl:54.2-14 "int result=0"
    [junit]   71->72: i=1 at printExpr.cvl:56.6-13 "int i=1"
    [junit]   72->73: LOOP_BODY_ENTER at printExpr.cvl:56.15-19 "i<=n"
    [junit]   73->74: result=0+1 [result:=1] at printExpr.cvl:57.4-13 "result+=i"
    [junit]   74->72: i=1+1 [i:=2] at printExpr.cvl:56.21-24 "i++"
    [junit]   72->73: LOOP_BODY_ENTER at printExpr.cvl:56.15-19 "i<=n"
    [junit]   73->74: result=1+2 [result:=3] at printExpr.cvl:57.4-13 "result+=i"
    [junit]   74->72: i=2+1 [i:=3] at printExpr.cvl:56.21-24 "i++"
    [junit]   72->75: LOOP_BODY_EXIT at printExpr.cvl:56.15-19 "i<=n"
    [junit]   75->RET: sum(...) return 3 [$sef$0:=3] at printExpr.cvl:58.2-16 "return result;"
    [junit]   69->RET: call(...) return 3 at printExpr.cvl:50.2-16 "return f(arg);"
    [junit]   50->51: p1=$spawn sum(1) [p1:=p1] at printExpr.cvl:104.2-18 "p1=$spawn sum(1)"
    [junit] --> State 18
    [junit] 
    [junit] State 18
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0 at printExpr.cvl:102.2-40 "p=(int*)$malloc($root ... )":
    [junit] | | | | | | 0: (int[10])Hop0s0f0o0
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = p1
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = &<d0>heap.malloc0[0][0]
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | | dyscope d10 (id=2, parent=d9, static=13)
    [junit] | | | variables
    [junit] | | | | result = NULL
    [junit] | | dyscope d9 (id=3, parent=d0, static=9)
    [junit] | | | variables
    [junit] | | | | n = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=51, printExpr.cvl:105.2-6 "p[5]", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=sum, location=70, printExpr.cvl:54.2-14 "int result=0", dyscope=d10]
    [junit] State 18, p0:
    [junit]   51->52: *(&<d0>heap.malloc0[0][0]+5)=5 at printExpr.cvl:105.2-8 "p[5]=5"
    [junit] --> State 19
    [junit] 
    [junit] State 19
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0 at printExpr.cvl:102.2-40 "p=(int*)$malloc($root ... )":
    [junit] | | | | | | 0: (int[10])(Hop0s0f0o0){[5]=5}
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = p1
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = &<d0>heap.malloc0[0][0]
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | | dyscope d10 (id=2, parent=d9, static=13)
    [junit] | | | variables
    [junit] | | | | result = NULL
    [junit] | | dyscope d9 (id=3, parent=d0, static=9)
    [junit] | | | variables
    [junit] | | | | n = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=52, printExpr.cvl:106.2-7 "$wait", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=sum, location=70, printExpr.cvl:54.2-14 "int result=0", dyscope=d10]
    [junit] State 19, p1:
    [junit]   70->71: result=0 at printExpr.cvl:54.2-14 "int result=0"
    [junit]   71->72: i=1 at printExpr.cvl:56.6-13 "int i=1"
    [junit]   72->73: LOOP_BODY_ENTER at printExpr.cvl:56.15-19 "i<=n"
    [junit]   73->74: result=0+1 [result:=1] at printExpr.cvl:57.4-13 "result+=i"
    [junit]   74->72: i=1+1 [i:=2] at printExpr.cvl:56.21-24 "i++"
    [junit]   72->75: LOOP_BODY_EXIT at printExpr.cvl:56.15-19 "i<=n"
    [junit]   75->RET: sum(...) return 1 at printExpr.cvl:58.2-16 "return result;"
    [junit] --> State 20
    [junit] 
    [junit] State 20
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0 at printExpr.cvl:102.2-40 "p=(int*)$malloc($root ... )":
    [junit] | | | | | | 0: (int[10])(Hop0s0f0o0){[5]=5}
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = p1
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = &<d0>heap.malloc0[0][0]
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=52, printExpr.cvl:106.2-7 "$wait", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] State 20, p0:
    [junit]   52->53: $wait(p1) at printExpr.cvl:106.2-11 "$wait(p1)"
    [junit] --> State 21
    [junit] 
    [junit] State 21
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0 at printExpr.cvl:102.2-40 "p=(int*)$malloc($root ... )":
    [junit] | | | | | | 0: (int[10])(Hop0s0f0o0){[5]=5}
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = UNDEFINED
    [junit] | | dyscope d1 (id=1, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | k = &<d0>sum(n : int)
    [junit] | | | | A = (int[10])((X_s1v2p0){[1]=8, [2]=9, [3]=7}){[X0]=9}
    [junit] | | | | p = &<d0>heap.malloc0[0][0]
    [junit] | | | | n = length(X5)
    [junit] | | | | n1 = X1/X0
    [junit] | | | | n2 = X1%X0
    [junit] | | | | n3 = X0*X1
    [junit] | | | | n4 = -1*X1
    [junit] | | | | n5 = X0+-1*X1
    [junit] | | | | n6 = (int)(X8.0)
    [junit] | | | | n7 = random(length(X5))
    [junit] | | | | n8 = X0^5
    [junit] | | | | n9 = extract(0,X2)
    [junit] | | | | b = 0==-1*X0+X1
    [junit] | | | | b1 = 0!=-1*X0+X1
    [junit] | | | | b2 = !X6
    [junit] | | | | b3 = 0!=-1*X0+X1||X6
    [junit] | | | | d1 = X4/X3
    [junit] | | | | d2 = extract(1,X2)
    [junit] | | | | mu = (int)(X8.0)
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=53, printExpr.cvl:107.2-7 "$free", dyscope=d1]
    [junit] State 21, p0:
    [junit]   53->54: $free(&<d0>heap.malloc0[0][0]) at printExpr.cvl:107.2-10 "$free(p)"
    [junit]   54->RET: _CIVL_system(...) return at printExpr.cvl:108.0-1 "}"
    [junit] --> State 22
    [junit] 
    [junit] State 22
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 != X0) && (0 != X7.0) && (0 != X9.0) && (0 != X3) && (0 != X7.0 || 0 != X9.0) && (0 != X7.0 || 0 != X3) && (0 != X7.0 || !X6) && (0 != X7.0 || X6) && (0 != X9.0 || 0 != X3) && (0 != X9.0 || !X6) && (0 != X9.0 || X6) && (0 != X3 || !X6) && (0 != X3 || X6)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | | | y = X1
    [junit] | | | | MU = X2
    [junit] | | | | dx = X3
    [junit] | | | | dy = X4
    [junit] | | | | _A = (int[])X5
    [junit] | | | | B = X6
    [junit] | | | | p = X7
    [junit] | | | | pt = (Point)X8
    [junit] | | | | sc = X9
    [junit] | | | | p1 = UNDEFINED
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] 
    [junit] === Command ===
    [junit] civl verify -showProgram=false -showSavedStates -showTransitions examples/backend/printExpr.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.33
    [junit]    memory (bytes)      : 614465536
    [junit]    max process count   : 2
    [junit]    states              : 88
    [junit]    states saved        : 23
    [junit]    state matches       : 0
    [junit]    transitions         : 87
    [junit]    trace steps         : 19
    [junit]    valid calls         : 32
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 10
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] State 0, p0:
    [junit]   0->1: x=InitialValue(x) [x:=X0] at arrayWrite.cvl:13.0-12 "$input int x"
    [junit]   1->2: p0=(Point){0, 0} at arrayWrite.cvl:16.2-30 "Point p0={0,0} ... p2"
    [junit]   2->3: p1=(Point){1, 1} at arrayWrite.cvl:16.2-30 "Point p0={0,0} ... p2"
    [junit]   3->4: p2=InitialValue(p2) [p2:=(Point)X_s1v3p0] at arrayWrite.cvl:16.2-30 "Point p0={0,0} ... p2"
    [junit]   4->5: l0=(Line){{0, 0}, {1, 1}} at arrayWrite.cvl:17.2-42 "Line l0={p0, p1 ... p0"
    [junit]   5->6: l1=(Line){{1, 1}, X_s1v3p0} at arrayWrite.cvl:17.2-42 "Line l0={p0, p1 ... p0"
    [junit]   6->7: l2=(Line){X_s1v3p0, {0, 0}} at arrayWrite.cvl:17.2-42 "Line l0={p0, p1 ... p0"
    [junit]   7->8: lines=InitialValue(lines) [lines:=(Line[3])X_s1v7p0] at arrayWrite.cvl:18.2-26 "Line lines[3], lines1 ... ]"
    [junit]   8->9: lines1=InitialValue(lines1) [lines1:=(Line[3])X_s1v8p0] at arrayWrite.cvl:18.2-26 "Line lines[3], lines1 ... ]"
    [junit]   9->10: $assume((0<X0)&&(X0<3)) at arrayWrite.cvl:20.2-21 "$assume(x>0 && x ... )"
    [junit] --> State 2
    [junit] 
    [junit] State 2
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+2) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | dyscope d1 (id=1, parent=d0, static=2)
    [junit] | | | variables
    [junit] | | | | p0 = (Point){.x=0, .y=0}
    [junit] | | | | p1 = (Point){.x=1, .y=1}
    [junit] | | | | p2 = (Point)X_s1v3p0
    [junit] | | | | l0 = (Line){
    [junit] | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | .end={.x=1, .y=1}}
    [junit] | | | | l1 = (Line){
    [junit] | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | .end=X_s1v3p0}
    [junit] | | | | l2 = (Line){
    [junit] | | | | | .start=X_s1v3p0, 
    [junit] | | | | | .end={.x=0, .y=0}}
    [junit] | | | | lines = (Line[3])X_s1v7p0
    [junit] | | | | lines1 = (Line[3])X_s1v8p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=10, arrayWrite.cvl:21.2-10 "lines[0]", dyscope=d1]
    [junit] State 2, p0:
    [junit]   10->11: lines[0]=(Line){{0, 0}, {1, 1}} at arrayWrite.cvl:21.2-13 "lines[0]=l0"
    [junit] --> State 3
    [junit] 
    [junit] State 3
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+2) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | dyscope d1 (id=1, parent=d0, static=2)
    [junit] | | | variables
    [junit] | | | | p0 = (Point){.x=0, .y=0}
    [junit] | | | | p1 = (Point){.x=1, .y=1}
    [junit] | | | | p2 = (Point)X_s1v3p0
    [junit] | | | | l0 = (Line){
    [junit] | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | .end={.x=1, .y=1}}
    [junit] | | | | l1 = (Line){
    [junit] | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | .end=X_s1v3p0}
    [junit] | | | | l2 = (Line){
    [junit] | | | | | .start=X_s1v3p0, 
    [junit] | | | | | .end={.x=0, .y=0}}
    [junit] | | | | lines = (Line[3])(X_s1v7p0){
    [junit] | | | | | [0]={
    [junit] | | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | | .end={.x=1, .y=1}}}
    [junit] | | | | lines1 = (Line[3])X_s1v8p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=11, arrayWrite.cvl:22.2-10 "lines[x]", dyscope=d1]
    [junit] State 3, p0:
    [junit]   11->12: lines[X0]=(Line){{1, 1}, X_s1v3p0} at arrayWrite.cvl:22.2-13 "lines[x]=l1"
    [junit] --> State 4
    [junit] 
    [junit] State 4
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+2) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | dyscope d1 (id=1, parent=d0, static=2)
    [junit] | | | variables
    [junit] | | | | p0 = (Point){.x=0, .y=0}
    [junit] | | | | p1 = (Point){.x=1, .y=1}
    [junit] | | | | p2 = (Point)X_s1v3p0
    [junit] | | | | l0 = (Line){
    [junit] | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | .end={.x=1, .y=1}}
    [junit] | | | | l1 = (Line){
    [junit] | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | .end=X_s1v3p0}
    [junit] | | | | l2 = (Line){
    [junit] | | | | | .start=X_s1v3p0, 
    [junit] | | | | | .end={.x=0, .y=0}}
    [junit] | | | | lines = (Line[3])((X_s1v7p0){
    [junit] | | | | | [0]={
    [junit] | | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | | .end={.x=1, .y=1}}}){
    [junit] | | | | | [X0]=(Line){
    [junit] | | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | | .end=X_s1v3p0}}
    [junit] | | | | lines1 = (Line[3])X_s1v8p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, arrayWrite.cvl:23.2-10 "lines[1]", dyscope=d1]
    [junit] State 4, p0:
    [junit]   12->13: lines[1]=(Line){{1, 1}, X_s1v3p0} at arrayWrite.cvl:23.2-13 "lines[1]=l1"
    [junit] --> State 5
    [junit] 
    [junit] State 5
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+2) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | dyscope d1 (id=1, parent=d0, static=2)
    [junit] | | | variables
    [junit] | | | | p0 = (Point){.x=0, .y=0}
    [junit] | | | | p1 = (Point){.x=1, .y=1}
    [junit] | | | | p2 = (Point)X_s1v3p0
    [junit] | | | | l0 = (Line){
    [junit] | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | .end={.x=1, .y=1}}
    [junit] | | | | l1 = (Line){
    [junit] | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | .end=X_s1v3p0}
    [junit] | | | | l2 = (Line){
    [junit] | | | | | .start=X_s1v3p0, 
    [junit] | | | | | .end={.x=0, .y=0}}
    [junit] | | | | lines = (Line[3])(((X_s1v7p0){
    [junit] | | | | | [0]={
    [junit] | | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | | .end={.x=1, .y=1}}}){
    [junit] | | | | | [X0]=(Line){
    [junit] | | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | | .end=X_s1v3p0}}){
    [junit] | | | | | [1]={
    [junit] | | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | | .end=X_s1v3p0}}
    [junit] | | | | lines1 = (Line[3])X_s1v8p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=13, arrayWrite.cvl:24.2-11 "lines1[x]", dyscope=d1]
    [junit] State 5, p0:
    [junit]   13->14: lines1[X0]=(Line){X_s1v3p0, {0, 0}} at arrayWrite.cvl:24.2-14 "lines1[x]=l2"
    [junit] --> State 6
    [junit] 
    [junit] State 6
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+2) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | | dyscope d1 (id=1, parent=d0, static=2)
    [junit] | | | variables
    [junit] | | | | p0 = (Point){.x=0, .y=0}
    [junit] | | | | p1 = (Point){.x=1, .y=1}
    [junit] | | | | p2 = (Point)X_s1v3p0
    [junit] | | | | l0 = (Line){
    [junit] | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | .end={.x=1, .y=1}}
    [junit] | | | | l1 = (Line){
    [junit] | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | .end=X_s1v3p0}
    [junit] | | | | l2 = (Line){
    [junit] | | | | | .start=X_s1v3p0, 
    [junit] | | | | | .end={.x=0, .y=0}}
    [junit] | | | | lines = (Line[3])(((X_s1v7p0){
    [junit] | | | | | [0]={
    [junit] | | | | | | .start={.x=0, .y=0}, 
    [junit] | | | | | | .end={.x=1, .y=1}}}){
    [junit] | | | | | [X0]=(Line){
    [junit] | | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | | .end=X_s1v3p0}}){
    [junit] | | | | | [1]={
    [junit] | | | | | | .start={.x=1, .y=1}, 
    [junit] | | | | | | .end=X_s1v3p0}}
    [junit] | | | | lines1 = (Line[3])(X_s1v8p0){
    [junit] | | | | | [X0]=(Line){
    [junit] | | | | | | .start=X_s1v3p0, 
    [junit] | | | | | | .end={.x=0, .y=0}}}
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=14, arrayWrite.cvl:25.2-11 "lines1[1]", dyscope=d1]
    [junit] State 6, p0:
    [junit]   14->15: lines1[1]=(Line){{0, 0}, {1, 1}} at arrayWrite.cvl:25.2-14 "lines1[1]=l0"
    [junit]   15->RET: _CIVL_system(...) return at arrayWrite.cvl:26.0-1 "}"
    [junit] --> State 7
    [junit] 
    [junit] State 7
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+2) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | x = X0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] 
    [junit] === Command ===
    [junit] civl verify -showProgram=false -showSavedStates -showTransitions examples/backend/arrayWrite.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.09
    [junit]    memory (bytes)      : 614465536
    [junit]    max process count   : 1
    [junit]    states              : 17
    [junit]    states saved        : 8
    [junit]    state matches       : 0
    [junit]    transitions         : 16
    [junit]    trace steps         : 6
    [junit]    valid calls         : 5
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.CompareTest
    [junit] Tests run: 7, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 10.304 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Specification and implementation have different values for the output _sum!
    [junit] 
    [junit] Violation 0 encountered at depth 304:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at mpithreads_serial.c:36.0-19 "$output double _sum":
    [junit] Context: (0 <= SIZEOF(dynamicType<302>)+-1) && (0 <= SIZEOF_REAL+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 <= -1*X2+2) && (0 <= X3+-2)
    [junit] Assertion voilated: $assert_equals(&(_sum_spec), &(_sum), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(_sum_spec)=&<d0>_sum_spec
    [junit]           &(_sum)=&<d0>_sum
    [junit] Result: 
    [junit]           <d0>_sum_spec=5
    [junit]           <d0>_sum=10
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at mpithreads_serial.c:36.0-7 "$output"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/Composite_mpithreads_serial_mpithreads_mpi_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl compare -enablePrintf=false -inputVECLEN=5 -spec examples/compare/dot/mpithreads_serial.c -impl -input_NPROCS=2 examples/compare/dot/mpithreads_mpi.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 2.25
    [junit]    memory (bytes)      : 614465536
    [junit]    max process count   : 3
    [junit]    states              : 588
    [junit]    states saved        : 317
    [junit]    state matches       : 0
    [junit]    transitions         : 588
    [junit]    trace steps         : 303
    [junit]    valid calls         : 1342
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 8
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/Composite_mpithreads_serial_mpithreads_mpi_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Done. Serial version: sum =  5 
    [junit] Task 0 partial sum is 5
    [junit] Task 1 partial sum is 5
    [junit] Done. MPI version: sum  =  10 
    [junit] Specification and implementation have different values for the output _sum!
    [junit] Error 0:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at mpithreads_serial.c:36.0-19 "$output double _sum":
    [junit] Context: (0 <= SIZEOF(dynamicType<302>)+-1) && (0 <= SIZEOF_REAL+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 <= -1*X2+2) && (0 <= X3+-2)
    [junit] Assertion voilated: $assert_equals(&(_sum_spec), &(_sum), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(_sum_spec)=&<d0>_sum_spec
    [junit]           &(_sum)=&<d0>_sum
    [junit] Result: 
    [junit]           <d0>_sum_spec=5
    [junit]           <d0>_sum=10
    [junit] State -1:46739
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF(dynamicType<302>)+-1) && (0 <= SIZEOF_REAL+-1) && (0 <= -1*X0+9) && (0 <= X0+-1) && (0 <= -1*X2+2) && (0 <= X3+-2)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | CIVL_argc = X0
    [junit] | | | | CIVL_argv = (CHAR[10][])X1
    [junit] | | | | VECLEN = 5
    [junit] | | | | _NPROCS = 2
    [junit] | | | | _NPROCS_LOWER_BOUND = X2
    [junit] | | | | _NPROCS_UPPER_BOUND = X3
    [junit] | | | | _sum_spec = 5
    [junit] | | | | _sum = 10
    [junit] | | | | _anon_0 = "Specification and implementation have different values for the output _sum!"
    [junit] | | | | _anon_1 = "Done. Serial version: sum =  %f \n"
    [junit] | | | | _anon_2 = "MPI_Comm_size() cannot be invoked without MPI_Init() being called before.\n"
    [junit] | | | | _anon_3 = "MPI_Comm_rank() cannot be invoked without MPI_Init() being called before.\n"
    [junit] | | | | _anon_4 = "MPI_Reduce() cannot be invoked without MPI_Init() being called before.\n"
    [junit] | | | | _anon_5 = "Process with rank %d is calling an possibly inconsistent MPI_Reduce routine with at least one of other processes.\n"
    [junit] | | | | _anon_6 = "MPI_Reduce()"
    [junit] | | | | _anon_7 = NULL
    [junit] | | | | _anon_8 = "Process terminates without calling MPI_Finalize() first."
    [junit] | | | | _anon_9 = "Collective routine %s receives a message with a mismatched tag\n"
    [junit] | | | | _anon_10 = "Message of size %d exceeds the specified size %d."
    [junit] | | | | _anon_11 = "Task %d partial sum is %f\n"
    [junit] | | | | _anon_12 = "Done. MPI version: sum  =  %f \n"
    [junit] | | dyscope d1 (id=1, parent=d0, static=6)
    [junit] | | | variables
    [junit] | | | | _isEqual = NULL
    [junit] | | dyscope d2 (id=2, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | dyscope d3 (id=3, parent=d2, static=7)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0 at mpithreads_serial.c:89.0-41 "a = (double*)  ... )":
    [junit] | | | | | | 0: (real[])INVALID
    [junit] | | | | | objects of malloc 1 at mpithreads_serial.c:90.0-41 "b = (double*)  ... )":
    [junit] | | | | | | 0: (real[])INVALID
    [junit] | | | | $gen_root = d3
    [junit] | | | | dotstr = ($anon_struct_3){.a=UNDEFINED, .b=UNDEFINED, .sum=5, .veclen=5}
    [junit] | | | | _argv = (pointer[10]){&<d0>CIVL_argv[0][0], &<d0>CIVL_argv[1][0], &<d0>CIVL_argv[2][0], &<d0>CIVL_argv[3][0], &<d0>CIVL_argv[4][0], &<d0>CIVL_argv[5][0], &<d0>CIVL_argv[6][0], &<d0>CIVL_argv[7][0], &<d0>CIVL_argv[8][0], &<d0>CIVL_argv[9][0]}
    [junit] | | dyscope d4 (id=4, parent=d3, static=14)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | dyscope d5 (id=5, parent=d3, static=13)
    [junit] | | | variables
    [junit] | | | | argc = X0
    [junit] | | | | argv = &<d3>_argv[0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=66)
    [junit] | | | variables
    [junit] | | | | i = 5
    [junit] | | | | len = 5
    [junit] | | | | a = UNDEFINED
    [junit] | | | | b = UNDEFINED
    [junit] | | dyscope d7 (id=7, parent=d3, static=12)
    [junit] | | | variables
    [junit] | | dyscope d8 (id=8, parent=d7, static=65)
    [junit] | | | variables
    [junit] | | | | start = 0
    [junit] | | | | end = 5
    [junit] | | | | i = 5
    [junit] | | | | mysum = 5
    [junit] | | | | x = UNDEFINED
    [junit] | | | | y = UNDEFINED
    [junit] | | dyscope d9 (id=9, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 4:
    [junit] | | | | | | 0: ($gbarrier[])INVALID
    [junit] | | | | | objects of malloc 6:
    [junit] | | | | | | 0: ($gcollect_checker[])INVALID
    [junit] | | | | | objects of malloc 8:
    [junit] | | | | | | 0: ($gcomm[])INVALID
    [junit] | | | | | | 1: ($gcomm[])INVALID
    [junit] | | | | GCOMM_WORLD = (CMPI_Gcomm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .gbarrier=UNDEFINED}
    [junit] | | | | GCOMMS = (CMPI_Gcomm[1]){
    [junit] | | | | | {.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .gbarrier=UNDEFINED}}
    [junit] | | | | _dom_size0 = 2
    [junit] | | | | _par_procs0 = (process[2]){UNDEFINED, UNDEFINED}
    [junit] | | dyscope d11 (id=11, parent=d10, static=49)
    [junit] | | | variables
    [junit] | | | | scope = d10
    [junit] | | | | size = 2
    [junit] | | dyscope d12 (id=12, parent=d11, static=71)
    [junit] | | | variables
    [junit] | | | | result = (CMPI_Gcomm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .gbarrier=UNDEFINED}
    [junit] | | dyscope d13 (id=13, parent=d10, static=46)
    [junit] | | | variables
    [junit] | | | | x = 2
    [junit] | | dyscope d14 (id=14, parent=d13, static=70)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d15 (id=15, parent=d10, static=62)
    [junit] | | | variables
    [junit] | | | | $mpi_rank = 0
    [junit] | | dyscope d16 (id=16, parent=d15, static=83)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 2 at mpithreads_mpi.c:107.0-50 "a = (double*)  ... )":
    [junit] | | | | | | 0: (real[])INVALID
    [junit] | | | | | objects of malloc 3 at mpithreads_mpi.c:108.0-50 "b = (double*)  ... )":
    [junit] | | | | | | 0: (real[])INVALID
    [junit] | | | | | objects of malloc 5:
    [junit] | | | | | | 0: ($barrier[])INVALID
    [junit] | | | | | objects of malloc 7:
    [junit] | | | | | | 0: ($collect_checker[])INVALID
    [junit] | | | | | objects of malloc 9:
    [junit] | | | | | | 0: ($comm[])INVALID
    [junit] | | | | | | 1: ($comm[])INVALID
    [junit] | | | | _my_status = 2
    [junit] | | | | MPI_COMM_WORLD = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | $gen_root = d16
    [junit] | | | | dotstr = ($anon_struct_4){.a=UNDEFINED, .b=UNDEFINED, .sum=5, .veclen=5}
    [junit] | | dyscope d17 (id=17, parent=d10, static=62)
    [junit] | | | variables
    [junit] | | | | $mpi_rank = 1
    [junit] | | dyscope d18 (id=18, parent=d17, static=83)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 2 at mpithreads_mpi.c:107.0-50 "a = (double*)  ... )":
    [junit] | | | | | | 0: (real[])INVALID
    [junit] | | | | | objects of malloc 3 at mpithreads_mpi.c:108.0-50 "b = (double*)  ... )":
    [junit] | | | | | | 0: (real[])INVALID
    [junit] | | | | | objects of malloc 5:
    [junit] | | | | | | 0: ($barrier[])INVALID
    [junit] | | | | | objects of malloc 7:
    [junit] | | | | | | 0: ($collect_checker[])INVALID
    [junit] | | | | | objects of malloc 9:
    [junit] | | | | | | 0: ($comm[])INVALID
    [junit] | | | | | | 1: ($comm[])INVALID
    [junit] | | | | _my_status = 2
    [junit] | | | | MPI_COMM_WORLD = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | $gen_root = d18
    [junit] | | | | dotstr = ($anon_struct_4){.a=UNDEFINED, .b=UNDEFINED, .sum=5, .veclen=5}
    [junit] | | dyscope d19 (id=19, parent=d10, static=51)
    [junit] | | | variables
    [junit] | | | | scope = d16
    [junit] | | | | gc = (CMPI_Gcomm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .gbarrier=UNDEFINED}
    [junit] | | | | rank = 0
    [junit] | | dyscope d20 (id=20, parent=d19, static=72)
    [junit] | | | variables
    [junit] | | | | result = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d21 (id=21, parent=d16, static=87)
    [junit] | | | variables
    [junit] | | | | _argv = (pointer[10]){&<d0>CIVL_argv[0][0], &<d0>CIVL_argv[1][0], &<d0>CIVL_argv[2][0], &<d0>CIVL_argv[3][0], &<d0>CIVL_argv[4][0], &<d0>CIVL_argv[5][0], &<d0>CIVL_argv[6][0], &<d0>CIVL_argv[7][0], &<d0>CIVL_argv[8][0], &<d0>CIVL_argv[9][0]}
    [junit] | | dyscope d22 (id=22, parent=d21, static=88)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | dyscope d23 (id=23, parent=d16, static=86)
    [junit] | | | variables
    [junit] | | | | argc = X0
    [junit] | | | | argv = &<d21>_argv[0]
    [junit] | | dyscope d24 (id=24, parent=d23, static=90)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | | | len = 5
    [junit] | | | | myid = 0
    [junit] | | | | numprocs = 2
    [junit] | | | | a = UNDEFINED
    [junit] | | | | b = UNDEFINED
    [junit] | | | | mysum = 5
    [junit] | | | | allsum = 10
    [junit] | | dyscope d25 (id=25, parent=d10, static=53)
    [junit] | | | variables
    [junit] | | dyscope d26 (id=26, parent=d10, static=42)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | size = &<d24>numprocs
    [junit] | | dyscope d27 (id=27, parent=d26, static=67)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d28 (id=28, parent=d10, static=43)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | rank = &<d24>myid
    [junit] | | dyscope d29 (id=29, parent=d28, static=68)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d62 (id=30, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d31 (id=31, parent=d16, static=85)
    [junit] | | | variables
    [junit] | | dyscope d32 (id=32, parent=d31, static=89)
    [junit] | | | variables
    [junit] | | | | i = 5
    [junit] | | | | start = 0
    [junit] | | | | end = 5
    [junit] | | | | myid = 0
    [junit] | | | | len = 5
    [junit] | | | | mysum = 5
    [junit] | | | | x = UNDEFINED
    [junit] | | | | y = UNDEFINED
    [junit] | | dyscope d33 (id=33, parent=d10, static=43)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | rank = &<d32>myid
    [junit] | | dyscope d34 (id=34, parent=d33, static=68)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d62 (id=35, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d36 (id=36, parent=d10, static=44)
    [junit] | | | variables
    [junit] | | | | sendbuf = &<d24>mysum
    [junit] | | | | recvbuf = &<d24>allsum
    [junit] | | | | count = 1
    [junit] | | | | datatype = 23
    [junit] | | | | op = 3
    [junit] | | | | root = 0
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d37 (id=37, parent=d36, static=69)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | | | place = 0
    [junit] | | | | nprocs = 2
    [junit] | | | | datatypes = (int[1]){23}
    [junit] | | | | checkerEntries = (Entries[1]){
    [junit] | | | | | {9998, 0, 3, 1, {23}}}
    [junit] | | | | checkPassed = true
    [junit] | | dyscope d62 (id=38, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d39 (id=39, parent=d10, static=57)
    [junit] | | | variables
    [junit] | | | | routineTag = 9998
    [junit] | | | | root = 0
    [junit] | | | | op = 3
    [junit] | | | | numDatatypes = 1
    [junit] | | | | datatypes = &<d37>datatypes[0]
    [junit] | | dyscope d40 (id=40, parent=d39, static=79)
    [junit] | | | variables
    [junit] | | | | zero = 0
    [junit] | | | | bundledEntries = (Entries[1]){
    [junit] | | | | | {9998, 0, 3, 1, {23}}}
    [junit] | | | | entries = (Entries){
    [junit] | | | | | .routine_tag=9998, 
    [junit] | | | | | .root=0, 
    [junit] | | | | | .op=3, 
    [junit] | | | | | .numTypes=1, 
    [junit] | | | | | .datatypes={23}}
    [junit] | | dyscope d41 (id=41, parent=d40, static=80)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d42 (id=42, parent=d10, static=56)
    [junit] | | | variables
    [junit] | | | | sendbuf = &<d24>mysum
    [junit] | | | | recvbuf = &<d24>allsum
    [junit] | | | | count = 1
    [junit] | | | | datatype = 23
    [junit] | | | | op = 3
    [junit] | | | | root = 0
    [junit] | | | | tag = 9998
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | routName = &<d0>_anon_6[0]
    [junit] | | dyscope d43 (id=43, parent=d42, static=75)
    [junit] | | | variables
    [junit] | | | | rank = 0
    [junit] | | dyscope d62 (id=44, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d45 (id=45, parent=d43, static=76)
    [junit] | | | variables
    [junit] | | | | nprocs = 2
    [junit] | | | | size = SIZEOF_REAL
    [junit] | | | | $sef$1 = SIZEOF_REAL
    [junit] | | dyscope d46 (id=46, parent=d10, static=48)
    [junit] | | | variables
    [junit] | | | | datatype = 23
    [junit] | | dyscope d47 (id=47, parent=d10, static=61)
    [junit] | | | variables
    [junit] | | | | p = &<d24>allsum
    [junit] | | | | q = &<d24>mysum
    [junit] | | | | size = SIZEOF_REAL
    [junit] | | dyscope d48 (id=48, parent=d47, static=82)
    [junit] | | | variables
    [junit] | | | | bundle = (real[1]){
    [junit] | | | | | 5}
    [junit] | | dyscope d49 (id=49, parent=d45, static=77)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d50 (id=50, parent=d49, static=78)
    [junit] | | | variables
    [junit] | | | | colTag = 9998
    [junit] | | | | in = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=9998, 
    [junit] | | | | | .data=(real[1]){
    [junit] | | | | | | 5}, 
    [junit] | | | | | .size=SIZEOF_REAL}
    [junit] | | dyscope d51 (id=51, parent=d10, static=51)
    [junit] | | | variables
    [junit] | | | | scope = d18
    [junit] | | | | gc = (CMPI_Gcomm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .gbarrier=UNDEFINED}
    [junit] | | | | rank = 1
    [junit] | | dyscope d52 (id=52, parent=d51, static=72)
    [junit] | | | variables
    [junit] | | | | result = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d53 (id=53, parent=d18, static=87)
    [junit] | | | variables
    [junit] | | | | _argv = (pointer[10]){&<d0>CIVL_argv[0][0], &<d0>CIVL_argv[1][0], &<d0>CIVL_argv[2][0], &<d0>CIVL_argv[3][0], &<d0>CIVL_argv[4][0], &<d0>CIVL_argv[5][0], &<d0>CIVL_argv[6][0], &<d0>CIVL_argv[7][0], &<d0>CIVL_argv[8][0], &<d0>CIVL_argv[9][0]}
    [junit] | | dyscope d54 (id=54, parent=d53, static=88)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | dyscope d55 (id=55, parent=d18, static=86)
    [junit] | | | variables
    [junit] | | | | argc = X0
    [junit] | | | | argv = &<d53>_argv[0]
    [junit] | | dyscope d56 (id=56, parent=d55, static=90)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | | | len = 5
    [junit] | | | | myid = 1
    [junit] | | | | numprocs = 2
    [junit] | | | | a = UNDEFINED
    [junit] | | | | b = UNDEFINED
    [junit] | | | | mysum = 5
    [junit] | | | | allsum = NULL
    [junit] | | dyscope d25 (id=57, parent=d10, static=53)
    [junit] | | | variables
    [junit] | | dyscope d58 (id=58, parent=d10, static=42)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | size = &<d56>numprocs
    [junit] | | dyscope d59 (id=59, parent=d58, static=67)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d60 (id=60, parent=d10, static=43)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | rank = &<d56>myid
    [junit] | | dyscope d61 (id=61, parent=d60, static=68)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d62 (id=62, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d63 (id=63, parent=d18, static=85)
    [junit] | | | variables
    [junit] | | dyscope d64 (id=64, parent=d63, static=89)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | | | start = 5
    [junit] | | | | end = 10
    [junit] | | | | myid = 1
    [junit] | | | | len = 5
    [junit] | | | | mysum = 5
    [junit] | | | | x = UNDEFINED
    [junit] | | | | y = UNDEFINED
    [junit] | | dyscope d65 (id=65, parent=d10, static=43)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | rank = &<d64>myid
    [junit] | | dyscope d66 (id=66, parent=d65, static=68)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d62 (id=67, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d68 (id=68, parent=d10, static=44)
    [junit] | | | variables
    [junit] | | | | sendbuf = &<d56>mysum
    [junit] | | | | recvbuf = &<d56>allsum
    [junit] | | | | count = 1
    [junit] | | | | datatype = 23
    [junit] | | | | op = 3
    [junit] | | | | root = 0
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d69 (id=69, parent=d68, static=69)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | | | place = 1
    [junit] | | | | nprocs = 2
    [junit] | | | | datatypes = (int[1]){23}
    [junit] | | | | checkerEntries = (Entries[1]){
    [junit] | | | | | {9998, 0, 3, 1, {23}}}
    [junit] | | | | checkPassed = true
    [junit] | | dyscope d62 (id=70, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d71 (id=71, parent=d10, static=57)
    [junit] | | | variables
    [junit] | | | | routineTag = 9998
    [junit] | | | | root = 0
    [junit] | | | | op = 3
    [junit] | | | | numDatatypes = 1
    [junit] | | | | datatypes = &<d69>datatypes[0]
    [junit] | | dyscope d72 (id=72, parent=d71, static=79)
    [junit] | | | variables
    [junit] | | | | zero = 0
    [junit] | | | | bundledEntries = (Entries[1]){
    [junit] | | | | | {9998, 0, 3, 1, {23}}}
    [junit] | | | | entries = (Entries){
    [junit] | | | | | .routine_tag=9998, 
    [junit] | | | | | .root=0, 
    [junit] | | | | | .op=3, 
    [junit] | | | | | .numTypes=1, 
    [junit] | | | | | .datatypes={23}}
    [junit] | | dyscope d73 (id=73, parent=d72, static=80)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d74 (id=74, parent=d10, static=56)
    [junit] | | | variables
    [junit] | | | | sendbuf = &<d56>mysum
    [junit] | | | | recvbuf = &<d56>allsum
    [junit] | | | | count = 1
    [junit] | | | | datatype = 23
    [junit] | | | | op = 3
    [junit] | | | | root = 0
    [junit] | | | | tag = 9998
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | routName = &<d0>_anon_6[0]
    [junit] | | dyscope d75 (id=75, parent=d74, static=75)
    [junit] | | | variables
    [junit] | | | | rank = 1
    [junit] | | dyscope d62 (id=76, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d77 (id=77, parent=d10, static=55)
    [junit] | | | variables
    [junit] | | | | buf = &<d56>mysum
    [junit] | | | | count = 1
    [junit] | | | | datatype = 23
    [junit] | | | | dest = 0
    [junit] | | | | tag = 9998
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d78 (id=78, parent=d77, static=74)
    [junit] | | | variables
    [junit] | | | | $sef$0 = SIZEOF_REAL
    [junit] | | | | size = SIZEOF_REAL
    [junit] | | | | place = 1
    [junit] | | | | out = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=9998, 
    [junit] | | | | | .data=(real[1]){
    [junit] | | | | | | 5}, 
    [junit] | | | | | .size=SIZEOF_REAL}
    [junit] | | dyscope d46 (id=79, parent=d10, static=48)
    [junit] | | | variables
    [junit] | | | | datatype = 23
    [junit] | | dyscope d62 (id=80, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d81 (id=81, parent=d10, static=58)
    [junit] | | | variables
    [junit] | | | | source = 1
    [junit] | | | | dest = 0
    [junit] | | | | tag = 9998
    [junit] | | | | data = &<d56>mysum
    [junit] | | | | size = SIZEOF_REAL
    [junit] | | dyscope d82 (id=82, parent=d81, static=81)
    [junit] | | | variables
    [junit] | | | | result = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=9998, 
    [junit] | | | | | .data=(real[1]){
    [junit] | | | | | | 5}, 
    [junit] | | | | | .size=SIZEOF_REAL}
    [junit] | | dyscope d83 (id=83, parent=d10, static=59)
    [junit] | | | variables
    [junit] | | | | message = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=9998, 
    [junit] | | | | | .data=(real[1]){
    [junit] | | | | | | 5}, 
    [junit] | | | | | .size=SIZEOF_REAL}
    [junit] | | dyscope d84 (id=84, parent=d10, static=54)
    [junit] | | | variables
    [junit] | | dyscope d85 (id=85, parent=d10, static=52)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d86 (id=86, parent=d85, static=73)
    [junit] | | | variables
    [junit] | | | | curr_status = 2
    [junit] | | dyscope d84 (id=87, parent=d10, static=54)
    [junit] | | | variables
    [junit] | | dyscope d85 (id=88, parent=d10, static=52)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d89 (id=89, parent=d85, static=73)
    [junit] | | | variables
    [junit] | | | | curr_status = 2
    [junit] | | dyscope d90 (id=90, parent=d10, static=50)
    [junit] | | | variables
    [junit] | | | | gc = (CMPI_Gcomm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .gbarrier=UNDEFINED}
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=11, mpithreads_serial.c:36.0-7 "$output", dyscope=d1]
    [junit] | | process - (id=1): null
    [junit] | | process - (id=2): null
    [junit] 
    [junit] Trace ends after 304 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] === Command ===
    [junit] civl replay -spec examples/compare/dot/mpithreads_serial.c -impl -input_NPROCS=2 examples/compare/dot/mpithreads_mpi.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.62
    [junit]    memory (bytes)      : 677904384
    [junit]    max process count   : 3
    [junit]    states              : 588
    [junit]    states Saved        : 317
    [junit]    valid calls         : 1343
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 8
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Specification and implementation have different values for the output _sum!
    [junit] 
    [junit] Violation 0 encountered at depth 192:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at mpithreads_serial.c:36.0-19 "$output double _sum":
    [junit] Context: (0 <= SIZEOF_REAL+-1) && (0 <= -1*X0+9) && (0 <= X0+-1)
    [junit] Assertion voilated: $assert_equals(&(_sum_spec), &(_sum), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(_sum_spec)=&<d0>_sum_spec
    [junit]           &(_sum)=&<d0>_sum
    [junit] Result: 
    [junit]           <d0>_sum_spec=5
    [junit]           <d0>_sum=10
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at mpithreads_serial.c:36.0-7 "$output"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/Composite_mpithreads_serial_mpithreads_threads_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl compare -enablePrintf=false -inputVECLEN=5 -spec examples/compare/dot/mpithreads_serial.c -impl -inputMAXTHRDS=2 examples/compare/dot/mpithreads_threads.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.65
    [junit]    memory (bytes)      : 677904384
    [junit]    max process count   : 3
    [junit]    states              : 386
    [junit]    states saved        : 198
    [junit]    state matches       : 0
    [junit]    transitions         : 386
    [junit]    trace steps         : 191
    [junit]    valid calls         : 408
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 4
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/Composite_mpithreads_serial_mpithreads_threads_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl compare -enablePrintf=false -inputVECLEN=5 -spec -inputMAXTHRDS=2 examples/compare/dot/mpithreads_threads.c -impl -input_NPROCS=2 examples/compare/dot/mpithreads_mpi.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.75
    [junit]    memory (bytes)      : 773324800
    [junit]    max process count   : 3
    [junit]    states              : 2453
    [junit]    states saved        : 1137
    [junit]    state matches       : 161
    [junit]    transitions         : 2613
    [junit]    trace steps         : 1284
    [junit]    valid calls         : 4714
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 8
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Specification and implementation have different values for the output result!
    [junit] 
    [junit] Violation 0 encountered at depth 53:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at max.cvl:6.0-18 "$output int result":
    [junit] Context: (0 <= -1*X1[1]+X1[2]+-1) && (0 <= X1[1]+-1*X1[0]+-1) && (0 <= X1[0]+-1)
    [junit] Assertion voilated: $assert_equals(&(result_spec), &(result), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(result_spec)=&<d0>result_spec
    [junit]           &(result)=&<d0>result
    [junit] Result: 
    [junit]           <d0>result_spec=X1[2]
    [junit]           <d0>result=X1[1]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at max.cvl:6.0-7 "$output"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/Composite_max_max_0.trace
    [junit] Restricting search depth to 52
    [junit] Specification and implementation have different values for the output result!
    [junit] 
    [junit] Violation 1 encountered at depth 50:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at max.cvl:6.0-18 "$output int result":
    [junit] Context: (0 <= -1*X1[1]+X1[2]+-1) && (0 <= -1*X1[1]) && (0 <= X1[1]+-1*X1[0]+-1) && (0 <= -1*X1[2]) && (0 <= -1*X1[0])
    [junit] Assertion voilated: $assert_equals(&(result_spec), &(result), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(result_spec)=&<d0>result_spec
    [junit]           &(result)=&<d0>result
    [junit] Result: 
    [junit]           <d0>result_spec=X1[2]
    [junit]           <d0>result=0
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at max.cvl:6.0-7 "$output"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (50) is less than length of old (53): replacing old with new...
    [junit] Restricting search depth to 49
    [junit] Specification and implementation have different values for the output result!
    [junit] 
    [junit] Violation 2 encountered at depth 42:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at max.cvl:6.0-18 "$output int result":
    [junit] Context: (0 <= -1*X1[1]) && (0 <= X1[1]+-1*X1[0]+-1) && (0 <= -1*X1[0])
    [junit] Assertion voilated: $assert_equals(&(result_spec), &(result), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(result_spec)=&<d0>result_spec
    [junit]           &(result)=&<d0>result
    [junit] Result: 
    [junit]           <d0>result_spec=X1[1]
    [junit]           <d0>result=0
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at max.cvl:6.0-7 "$output"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (42) is less than length of old (50): replacing old with new...
    [junit] Restricting search depth to 41
    [junit] Specification and implementation have different values for the output result!
    [junit] 
    [junit] Violation 3 encountered at depth 35:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at max.cvl:6.0-18 "$output int result":
    [junit] Context: 0 <= -1*X1[0]
    [junit] Assertion voilated: $assert_equals(&(result_spec), &(result), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(result_spec)=&<d0>result_spec
    [junit]           &(result)=&<d0>result
    [junit] Result: 
    [junit]           <d0>result_spec=X1[0]
    [junit]           <d0>result=0
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at max.cvl:6.0-7 "$output"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (35) is less than length of old (42): replacing old with new...
    [junit] Restricting search depth to 34
    [junit] 
    [junit] === Command ===
    [junit] civl compare -inputB=4 -min -spec examples/compare/max/max.cvl examples/compare/max/max_seq.cvl -impl -inputNPROCS=2 -inputBLOCK_SIZE=2 examples/compare/max/max.cvl examples/compare/max/max_par.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.34
    [junit]    memory (bytes)      : 773324800
    [junit]    max process count   : 3
    [junit]    states              : 1370
    [junit]    states saved        : 1222
    [junit]    state matches       : 20
    [junit]    transitions         : 1394
    [junit]    trace steps         : 1195
    [junit]    valid calls         : 6804
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 245
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/Composite_max_max_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Specification and implementation have different values for the output result!
    [junit] Error 0:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at max.cvl:6.0-18 "$output int result":
    [junit] Context: 0 <= -1*X1[0]
    [junit] Assertion voilated: $assert_equals(&(result_spec), &(result), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(result_spec)=&<d0>result_spec
    [junit]           &(result)=&<d0>result
    [junit] Result: 
    [junit]           <d0>result_spec=X1[0]
    [junit]           <d0>result=0
    [junit] State -1:64958
    [junit] | Path condition
    [junit] | | 0 <= -1*X1[0]
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | N = 1
    [junit] | | | | a = (int[1])X1
    [junit] | | | | B = 4
    [junit] | | | | BLOCK_SIZE = 2
    [junit] | | | | NPROCS = 2
    [junit] | | | | result_spec = X1[0]
    [junit] | | | | result = 0
    [junit] | | | | _anon_0 = "Specification and implementation have different values for the output result!"
    [junit] | | dyscope d1 (id=1, parent=d0, static=6)
    [junit] | | | variables
    [junit] | | | | _isEqual = NULL
    [junit] | | dyscope d2 (id=2, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | dyscope d3 (id=3, parent=d2, static=7)
    [junit] | | | variables
    [junit] | | dyscope d4 (id=4, parent=d3, static=9)
    [junit] | | | variables
    [junit] | | | | array = &<d0>a[0]
    [junit] | | | | length = 1
    [junit] | | dyscope d5 (id=5, parent=d4, static=14)
    [junit] | | | variables
    [junit] | | | | max = X1[0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d7 (id=7, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | dyscope d8 (id=8, parent=d7, static=10)
    [junit] | | | variables
    [junit] | | dyscope d9 (id=9, parent=d8, static=13)
    [junit] | | | variables
    [junit] | | | | array = &<d0>a[0]
    [junit] | | | | length = 1
    [junit] | | dyscope d10 (id=10, parent=d9, static=16)
    [junit] | | | variables
    [junit] | | | | myMax = 0
    [junit] | | | | procs = (process[2]){UNDEFINED, UNDEFINED}
    [junit] | | dyscope d11 (id=11, parent=d10, static=18)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d12 (id=12, parent=d10, static=17)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d13 (id=13, parent=d12, static=20)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d14 (id=14, parent=d10, static=17)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d15 (id=15, parent=d14, static=20)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d16 (id=16, parent=d10, static=19)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d17 (id=17, parent=d13, static=21)
    [junit] | | | variables
    [junit] | | | | currentIndex = 0
    [junit] | | dyscope d18 (id=18, parent=d15, static=21)
    [junit] | | | variables
    [junit] | | | | currentIndex = 2
    [junit] | | dyscope d17 (id=19, parent=d13, static=21)
    [junit] | | | variables
    [junit] | | | | currentIndex = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=10, max.cvl:6.0-7 "$output", dyscope=d1]
    [junit] | | process - (id=1): null
    [junit] | | process - (id=2): null
    [junit] 
    [junit] Trace ends after 35 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] === Command ===
    [junit] civl replay -min -spec examples/compare/max/max.cvl examples/compare/max/max_seq.cvl -impl examples/compare/max/max.cvl examples/compare/max/max_par.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.16
    [junit]    memory (bytes)      : 773324800
    [junit]    max process count   : 3
    [junit]    states              : 57
    [junit]    states Saved        : 39
    [junit]    valid calls         : 101
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 12
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl compare -inputN=10 -spec examples/compare/./sumNspec.cvl -impl examples/compare/./sumNimpl.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 773324800
    [junit]    max process count   : 1
    [junit]    states              : 46
    [junit]    states saved        : 17
    [junit]    state matches       : 0
    [junit]    transitions         : 45
    [junit]    trace steps         : 16
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl compare -enablePrintf=false -inputNPROCSB=2 -inputNB=4 -spec examples/compare/adder/adder_par.cvl -impl examples/compare/adder/adder_spec.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.89
    [junit]    memory (bytes)      : 768081920
    [junit]    max process count   : 3
    [junit]    states              : 803
    [junit]    states saved        : 402
    [junit]    state matches       : 0
    [junit]    transitions         : 802
    [junit]    trace steps         : 387
    [junit]    valid calls         : 971
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 17
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 518:
    [junit] CIVL execution violation in p2 (id = 2) (kind: MEMORY_LEAK, certainty: CONCRETE) 
    [junit] at MPItoCIVLTransformer:0.-1-20 "{\n__MPI_Sys_status..." inserted by MPItoCIVLTransformer.function body of MPI_Process before op.h:21.1-10 "Operation" included from civlc.cvh:11.9-15 "<op.h>" included from mpi.cvl:4.9-20 "<civlc.cvh>":
    [junit] The dyscope d18(id=10) has a non-empty heap upon termination.
    [junit] heap
    [junit] | objects of malloc 10:
    [junit] | | 0: (_pthread_gpool_t[1]){
    [junit] | | | {
    [junit] | | | | .threads={&<d18>callThd[0], &<d18>callThd[1]}}}
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   system_impl at MPItoCIVLTransformer:0.-1-20 "$parfor(int i: 0 ...." inserted by MPItoCIVLTransformer.$parfor MPI_Process before op.h:21.1-10 "Operation" included from civlc.cvh:11.9-15 "<op.h>" included from mpi.cvl:4.9-20 "<civlc.cvh>" called from
    [junit]   _CIVL_system at MPItoCIVLTransformer:0.-1-20 "int main()\n{\n  $el..." inserted by MPItoCIVLTransformer.definition of the main function before op.h:21.1-10 "Operation" included from civlc.cvh:11.9-15 "<op.h>" included from mpi.cvl:4.9-20 "<civlc.cvh>"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   _main at mpithreads_both.c:178.8-12 "_sum" called from
    [junit]   MPI_Process at GeneralTransformer:0.-1-20 "CIVL_argc, &_argv[..." inserted by GeneralTransformer.new main function before mpithreads_both.c:114.13-17 "argc"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   terminated
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/Composite_mpithreads_serial_mpithreads_both_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl compare -enablePrintf=false -inputVECLEN=5 -spec examples/compare/dot/mpithreads_serial.c -impl -input_NPROCS=2 -inputMAXTHRDS=2 examples/compare/dot/mpithreads_both.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.6
    [junit]    memory (bytes)      : 768081920
    [junit]    max process count   : 7
    [junit]    states              : 949
    [junit]    states saved        : 531
    [junit]    state matches       : 0
    [junit]    transitions         : 949
    [junit]    trace steps         : 517
    [junit]    valid calls         : 2265
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 8
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/Composite_mpithreads_serial_mpithreads_both_log.txt
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.ConcurrencyTest
    [junit] Tests run: 30, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 9.013 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=4 examples/concurrency/barrier2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.0
    [junit]    memory (bytes)      : 870842368
    [junit]    max process count   : 5
    [junit]    states              : 4770
    [junit]    states saved        : 1814
    [junit]    state matches       : 676
    [junit]    transitions         : 5445
    [junit]    trace steps         : 2483
    [junit]    valid calls         : 21953
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 13
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 164:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at MPItoCIVLTransformer:0.-1-20 "$parfor(int i: 0 ...." inserted by MPItoCIVLTransformer.$parfor MPI_Process before op.h:21.1-10 "Operation" included from civlc.cvh:11.9-15 "<op.h>" included from stdio.cvl:10.10-21 "<civlc.cvh>":
    [junit] A deadlock is possible:
    [junit]   Path condition: (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1)
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): terminated
    [junit] process p3 (id=3): terminated
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at MPItoCIVLTransformer:0.-1-20 "$parfor(int i: 0 ...." inserted by MPItoCIVLTransformer.$parfor MPI_Process before op.h:21.1-10 "Operation" included from civlc.cvh:11.9-15 "<op.h>" included from stdio.cvl:10.10-21 "<civlc.cvh>"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   CMPI_Recv at civl-mpi.cvl:143.18-31 "$comm_dequeue" called from
    [junit]   MPI_Recv at mpi.cvl:83.9-18 "CMPI_Recv" called from
    [junit]   _main at wildcardBad.c:23.4-12 "MPI_Recv" called from
    [junit]   MPI_Process at GeneralTransformer:0.-1-20 "CIVL_argc, &_argv[..." inserted by GeneralTransformer.new main function before wildcardBad.c:6.14-18 "argc"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   terminated
    [junit] 
    [junit] process p3 (id=3):
    [junit]   terminated
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/wildcardBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/concurrency/wildcardBad.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.71
    [junit]    memory (bytes)      : 870842368
    [junit]    max process count   : 4
    [junit]    states              : 330
    [junit]    states saved        : 170
    [junit]    state matches       : 0
    [junit]    transitions         : 329
    [junit]    trace steps         : 163
    [junit]    valid calls         : 1204
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 4
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/wildcardBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] I'm process 0 :
    [junit] 
    [junit] State 169
    [junit] | Path condition
    [junit] | | (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=3, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3}, 
    [junit] | | | | | | | | .in_barrier={false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | | objects of malloc 2:
    [junit] | | | | | | 0: ($gcollect_checker[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .length=0, 
    [junit] | | | | | | | | .records={}}}
    [junit] | | | | | objects of malloc 4:
    [junit] | | | | | | 0: ($gcomm[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=3, 
    [junit] | | | | | | | | .procs={p1, p2, p3}, 
    [junit] | | | | | | | | .isInit={true, true, true}, 
    [junit] | | | | | | | | .buf={
    [junit] | | | | | | | | | {
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}}, 
    [junit] | | | | | | | | | {
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}}, 
    [junit] | | | | | | | | | {
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=1, 
    [junit] | | | | | | | | | | | .messages={
    [junit] | | | | | | | | | | | | {
    [junit] | | | | | | | | | | | | | .source=2, 
    [junit] | | | | | | | | | | | | | .dest=0, 
    [junit] | | | | | | | | | | | | | .tag=1, 
    [junit] | | | | | | | | | | | | | .data=(int[1]){
    [junit] | | | | | | | | | | | | | | 2}, 
    [junit] | | | | | | | | | | | | | .size=SIZEOF_INT}}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}}}}}
    [junit] | | | | | | 1: ($gcomm[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=3, 
    [junit] | | | | | | | | .procs={p1, p2, p3}, 
    [junit] | | | | | | | | .isInit={true, true, true}, 
    [junit] | | | | | | | | .buf={
    [junit] | | | | | | | | | {
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}}, 
    [junit] | | | | | | | | | {
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}}, 
    [junit] | | | | | | | | | {
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}, 
    [junit] | | | | | | | | | | {
    [junit] | | | | | | | | | | | .length=0, 
    [junit] | | | | | | | | | | | .messages={}}}}}}
    [junit] | | | | CIVL_argc = X0
    [junit] | | | | CIVL_argv = (CHAR[10][])X1
    [junit] | | | | _NPROCS = 3
    [junit] | | | | GCOMM_WORLD = (CMPI_Gcomm){.p2p=&<d0>heap.malloc4[0][0], .col=&<d0>heap.malloc4[1][0], .collect_checker=&<d0>heap.malloc2[0][0], .gbarrier=&<d0>heap.malloc0[0][0]}
    [junit] | | | | GCOMMS = (CMPI_Gcomm[1]){
    [junit] | | | | | {.p2p=&<d0>heap.malloc4[0][0], .col=&<d0>heap.malloc4[1][0], .collect_checker=&<d0>heap.malloc2[0][0], .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | _dom_size0 = 3
    [junit] | | | | _par_procs0 = (process[3]){p1, p2, p3}
    [junit] | | | | _anon_0 = "MPI_Comm_size() cannot be invoked without MPI_Init() being called before.\n"
    [junit] | | | | _anon_1 = "MPI_Comm_rank() cannot be invoked without MPI_Init() being called before.\n"
    [junit] | | | | _anon_2 = "MPI_Send() cannot be invoked without MPI_Init() being called before.\n"
    [junit] | | | | _anon_3 = "MPI_Recv() cannot be invoked without MPI_Init() being called before.\n"
    [junit] | | | | _anon_4 = NULL
    [junit] | | | | _anon_5 = "Process terminates without calling MPI_Finalize() first."
    [junit] | | | | _anon_6 = "Message of size %d exceeds the specified size %d."
    [junit] | | | | _anon_7 = "I'm process %d :\n"
    [junit] | | dyscope d1 (id=1, parent=d0, static=30)
    [junit] | | | variables
    [junit] | | | | scope = d0
    [junit] | | | | size = 3
    [junit] | | dyscope d2 (id=2, parent=d1, static=52)
    [junit] | | | variables
    [junit] | | | | result = (CMPI_Gcomm){.p2p=&<d0>heap.malloc4[0][0], .col=&<d0>heap.malloc4[1][0], .collect_checker=&<d0>heap.malloc2[0][0], .gbarrier=&<d0>heap.malloc0[0][0]}
    [junit] | | dyscope d3 (id=3, parent=d0, static=27)
    [junit] | | | variables
    [junit] | | | | x = 3
    [junit] | | dyscope d4 (id=4, parent=d3, static=51)
    [junit] | | | variables
    [junit] | | | | i = 3
    [junit] | | dyscope d5 (id=5, parent=d0, static=44)
    [junit] | | | variables
    [junit] | | | | $mpi_rank = 0
    [junit] | | dyscope d6 (id=6, parent=d5, static=58)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | | objects of malloc 3:
    [junit] | | | | | | 0: ($collect_checker[1]){
    [junit] | | | | | | | {.checker=&<d0>heap.malloc2[0][0]}}
    [junit] | | | | | objects of malloc 5:
    [junit] | | | | | | 0: ($comm[1]){
    [junit] | | | | | | | {.place=0, .gcomm=&<d0>heap.malloc4[0][0]}}
    [junit] | | | | | | 1: ($comm[1]){
    [junit] | | | | | | | {.place=0, .gcomm=&<d0>heap.malloc4[1][0]}}
    [junit] | | | | _my_status = 1
    [junit] | | | | MPI_COMM_WORLD = (MPI_Comm){.p2p=&<d6>heap.malloc5[0][0], .col=&<d6>heap.malloc5[1][0], .collect_checker=&<d6>heap.malloc3[0][0], .barrier=&<d6>heap.malloc1[0][0], .gcommIndex=0}
    [junit] | | dyscope d7 (id=7, parent=d0, static=44)
    [junit] | | | variables
    [junit] | | | | $mpi_rank = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=58)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[])INVALID
    [junit] | | | | | objects of malloc 3:
    [junit] | | | | | | 0: ($collect_checker[])INVALID
    [junit] | | | | | objects of malloc 5:
    [junit] | | | | | | 0: ($comm[])INVALID
    [junit] | | | | | | 1: ($comm[])INVALID
    [junit] | | | | _my_status = 2
    [junit] | | | | MPI_COMM_WORLD = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d9 (id=9, parent=d0, static=44)
    [junit] | | | variables
    [junit] | | | | $mpi_rank = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=58)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[])INVALID
    [junit] | | | | | objects of malloc 3:
    [junit] | | | | | | 0: ($collect_checker[])INVALID
    [junit] | | | | | objects of malloc 5:
    [junit] | | | | | | 0: ($comm[])INVALID
    [junit] | | | | | | 1: ($comm[])INVALID
    [junit] | | | | _my_status = 2
    [junit] | | | | MPI_COMM_WORLD = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d11 (id=11, parent=d0, static=32)
    [junit] | | | variables
    [junit] | | | | scope = d6
    [junit] | | | | gc = (CMPI_Gcomm){.p2p=&<d0>heap.malloc4[0][0], .col=&<d0>heap.malloc4[1][0], .collect_checker=&<d0>heap.malloc2[0][0], .gbarrier=&<d0>heap.malloc0[0][0]}
    [junit] | | | | rank = 0
    [junit] | | dyscope d12 (id=12, parent=d11, static=53)
    [junit] | | | variables
    [junit] | | | | result = (MPI_Comm){.p2p=&<d6>heap.malloc5[0][0], .col=&<d6>heap.malloc5[1][0], .collect_checker=&<d6>heap.malloc3[0][0], .barrier=&<d6>heap.malloc1[0][0], .gcommIndex=0}
    [junit] | | dyscope d13 (id=13, parent=d6, static=61)
    [junit] | | | variables
    [junit] | | | | _argv = (pointer[10]){&<d0>CIVL_argv[0][0], &<d0>CIVL_argv[1][0], &<d0>CIVL_argv[2][0], &<d0>CIVL_argv[3][0], &<d0>CIVL_argv[4][0], &<d0>CIVL_argv[5][0], &<d0>CIVL_argv[6][0], &<d0>CIVL_argv[7][0], &<d0>CIVL_argv[8][0], &<d0>CIVL_argv[9][0]}
    [junit] | | dyscope d14 (id=14, parent=d13, static=62)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | dyscope d15 (id=15, parent=d6, static=60)
    [junit] | | | variables
    [junit] | | | | argc = X0
    [junit] | | | | argv = &<d13>_argv[0]
    [junit] | | dyscope d16 (id=16, parent=d15, static=63)
    [junit] | | | variables
    [junit] | | | | nprocs = 3
    [junit] | | | | rank = 0
    [junit] | | | | msg = 1
    [junit] | | | | status = (MPI_Status){.MPI_SOURCE=1, .MPI_TAG=1, .MPI_ERROR=0, .size=SIZEOF_INT}
    [junit] | | dyscope d17 (id=17, parent=d0, static=34)
    [junit] | | | variables
    [junit] | | dyscope d18 (id=18, parent=d0, static=24)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=&<d6>heap.malloc5[0][0], .col=&<d6>heap.malloc5[1][0], .collect_checker=&<d6>heap.malloc3[0][0], .barrier=&<d6>heap.malloc1[0][0], .gcommIndex=0}
    [junit] | | | | rank = &<d16>rank
    [junit] | | dyscope d19 (id=19, parent=d18, static=48)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d20 (id=20, parent=d0, static=43)
    [junit] | | | variables
    [junit] | | | | comm = &<d6>heap.malloc5[0][0]
    [junit] | | dyscope d21 (id=21, parent=d0, static=23)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=&<d6>heap.malloc5[0][0], .col=&<d6>heap.malloc5[1][0], .collect_checker=&<d6>heap.malloc3[0][0], .barrier=&<d6>heap.malloc1[0][0], .gcommIndex=0}
    [junit] | | | | size = &<d16>nprocs
    [junit] | | dyscope d22 (id=22, parent=d21, static=47)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d23 (id=23, parent=d0, static=26)
    [junit] | | | variables
    [junit] | | | | buf = &<d16>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 8
    [junit] | | | | source = -1
    [junit] | | | | tag = 1
    [junit] | | | | comm = (MPI_Comm){.p2p=&<d6>heap.malloc5[0][0], .col=&<d6>heap.malloc5[1][0], .collect_checker=&<d6>heap.malloc3[0][0], .barrier=&<d6>heap.malloc1[0][0], .gcommIndex=0}
    [junit] | | | | status = &<d16>status
    [junit] | | dyscope d24 (id=24, parent=d23, static=50)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | | | $sef$1 = 0
    [junit] | | dyscope d25 (id=25, parent=d0, static=37)
    [junit] | | | variables
    [junit] | | | | buf = &<d16>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 8
    [junit] | | | | source = -1
    [junit] | | | | tag = 1
    [junit] | | | | comm = &<d6>heap.malloc5[0][0]
    [junit] | | | | status = &<d16>status
    [junit] | | dyscope d26 (id=26, parent=d25, static=56)
    [junit] | | | variables
    [junit] | | | | in = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 1}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | | | $sef$3 = SIZEOF_INT
    [junit] | | | | size = SIZEOF_INT
    [junit] | | dyscope d27 (id=27, parent=d0, static=32)
    [junit] | | | variables
    [junit] | | | | scope = d8
    [junit] | | | | gc = (CMPI_Gcomm){.p2p=&<d0>heap.malloc4[0][0], .col=&<d0>heap.malloc4[1][0], .collect_checker=&<d0>heap.malloc2[0][0], .gbarrier=&<d0>heap.malloc0[0][0]}
    [junit] | | | | rank = 1
    [junit] | | dyscope d28 (id=28, parent=d27, static=53)
    [junit] | | | variables
    [junit] | | | | result = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d29 (id=29, parent=d8, static=61)
    [junit] | | | variables
    [junit] | | | | _argv = (pointer[10]){&<d0>CIVL_argv[0][0], &<d0>CIVL_argv[1][0], &<d0>CIVL_argv[2][0], &<d0>CIVL_argv[3][0], &<d0>CIVL_argv[4][0], &<d0>CIVL_argv[5][0], &<d0>CIVL_argv[6][0], &<d0>CIVL_argv[7][0], &<d0>CIVL_argv[8][0], &<d0>CIVL_argv[9][0]}
    [junit] | | dyscope d30 (id=30, parent=d29, static=62)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | dyscope d31 (id=31, parent=d8, static=60)
    [junit] | | | variables
    [junit] | | | | argc = X0
    [junit] | | | | argv = &<d29>_argv[0]
    [junit] | | dyscope d32 (id=32, parent=d31, static=63)
    [junit] | | | variables
    [junit] | | | | nprocs = 3
    [junit] | | | | rank = 1
    [junit] | | | | msg = 1
    [junit] | | | | status = (MPI_Status)X_s32v4p2
    [junit] | | dyscope d17 (id=33, parent=d0, static=34)
    [junit] | | | variables
    [junit] | | dyscope d34 (id=34, parent=d0, static=24)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | rank = &<d32>rank
    [junit] | | dyscope d35 (id=35, parent=d34, static=48)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d36 (id=36, parent=d0, static=43)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d37 (id=37, parent=d0, static=23)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | size = &<d32>nprocs
    [junit] | | dyscope d38 (id=38, parent=d37, static=47)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d39 (id=39, parent=d0, static=25)
    [junit] | | | variables
    [junit] | | | | buf = &<d32>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 8
    [junit] | | | | dest = 0
    [junit] | | | | tag = 1
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d40 (id=40, parent=d39, static=49)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | | | $sef$0 = 0
    [junit] | | dyscope d41 (id=41, parent=d0, static=36)
    [junit] | | | variables
    [junit] | | | | buf = &<d32>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 8
    [junit] | | | | dest = 0
    [junit] | | | | tag = 1
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d42 (id=42, parent=d41, static=55)
    [junit] | | | variables
    [junit] | | | | $sef$2 = SIZEOF_INT
    [junit] | | | | size = SIZEOF_INT
    [junit] | | | | place = 1
    [junit] | | | | out = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 1}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | dyscope d43 (id=43, parent=d0, static=29)
    [junit] | | | variables
    [junit] | | | | datatype = 8
    [junit] | | dyscope d36 (id=44, parent=d0, static=43)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d45 (id=45, parent=d0, static=38)
    [junit] | | | variables
    [junit] | | | | source = 1
    [junit] | | | | dest = 0
    [junit] | | | | tag = 1
    [junit] | | | | data = &<d32>msg
    [junit] | | | | size = SIZEOF_INT
    [junit] | | dyscope d46 (id=46, parent=d45, static=57)
    [junit] | | | variables
    [junit] | | | | result = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 1}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | dyscope d47 (id=47, parent=d0, static=35)
    [junit] | | | variables
    [junit] | | dyscope d48 (id=48, parent=d0, static=33)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d49 (id=49, parent=d48, static=54)
    [junit] | | | variables
    [junit] | | | | curr_status = 2
    [junit] | | dyscope d50 (id=50, parent=d0, static=32)
    [junit] | | | variables
    [junit] | | | | scope = d10
    [junit] | | | | gc = (CMPI_Gcomm){.p2p=&<d0>heap.malloc4[0][0], .col=&<d0>heap.malloc4[1][0], .collect_checker=&<d0>heap.malloc2[0][0], .gbarrier=&<d0>heap.malloc0[0][0]}
    [junit] | | | | rank = 2
    [junit] | | dyscope d51 (id=51, parent=d50, static=53)
    [junit] | | | variables
    [junit] | | | | result = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d52 (id=52, parent=d10, static=61)
    [junit] | | | variables
    [junit] | | | | _argv = (pointer[10]){&<d0>CIVL_argv[0][0], &<d0>CIVL_argv[1][0], &<d0>CIVL_argv[2][0], &<d0>CIVL_argv[3][0], &<d0>CIVL_argv[4][0], &<d0>CIVL_argv[5][0], &<d0>CIVL_argv[6][0], &<d0>CIVL_argv[7][0], &<d0>CIVL_argv[8][0], &<d0>CIVL_argv[9][0]}
    [junit] | | dyscope d53 (id=53, parent=d52, static=62)
    [junit] | | | variables
    [junit] | | | | i = 10
    [junit] | | dyscope d54 (id=54, parent=d10, static=60)
    [junit] | | | variables
    [junit] | | | | argc = X0
    [junit] | | | | argv = &<d52>_argv[0]
    [junit] | | dyscope d55 (id=55, parent=d54, static=63)
    [junit] | | | variables
    [junit] | | | | nprocs = 3
    [junit] | | | | rank = 2
    [junit] | | | | msg = 2
    [junit] | | | | status = (MPI_Status)X_s55v4p3
    [junit] | | dyscope d17 (id=56, parent=d0, static=34)
    [junit] | | | variables
    [junit] | | dyscope d57 (id=57, parent=d0, static=24)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | rank = &<d55>rank
    [junit] | | dyscope d58 (id=58, parent=d57, static=48)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d36 (id=59, parent=d0, static=43)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d60 (id=60, parent=d0, static=23)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | | | size = &<d55>nprocs
    [junit] | | dyscope d61 (id=61, parent=d60, static=47)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | dyscope d62 (id=62, parent=d0, static=25)
    [junit] | | | variables
    [junit] | | | | buf = &<d55>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 8
    [junit] | | | | dest = 0
    [junit] | | | | tag = 1
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d63 (id=63, parent=d62, static=49)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | | | $sef$0 = 0
    [junit] | | dyscope d64 (id=64, parent=d0, static=36)
    [junit] | | | variables
    [junit] | | | | buf = &<d55>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 8
    [junit] | | | | dest = 0
    [junit] | | | | tag = 1
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d65 (id=65, parent=d64, static=55)
    [junit] | | | variables
    [junit] | | | | $sef$2 = SIZEOF_INT
    [junit] | | | | size = SIZEOF_INT
    [junit] | | | | place = 2
    [junit] | | | | out = ($message){
    [junit] | | | | | .source=2, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 2}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | dyscope d43 (id=66, parent=d0, static=29)
    [junit] | | | variables
    [junit] | | | | datatype = 8
    [junit] | | dyscope d36 (id=67, parent=d0, static=43)
    [junit] | | | variables
    [junit] | | | | comm = UNDEFINED
    [junit] | | dyscope d68 (id=68, parent=d0, static=38)
    [junit] | | | variables
    [junit] | | | | source = 2
    [junit] | | | | dest = 0
    [junit] | | | | tag = 1
    [junit] | | | | data = &<d55>msg
    [junit] | | | | size = SIZEOF_INT
    [junit] | | dyscope d69 (id=69, parent=d68, static=57)
    [junit] | | | variables
    [junit] | | | | result = ($message){
    [junit] | | | | | .source=2, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 2}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | dyscope d47 (id=70, parent=d0, static=35)
    [junit] | | | variables
    [junit] | | dyscope d48 (id=71, parent=d0, static=33)
    [junit] | | | variables
    [junit] | | | | comm = (MPI_Comm){.p2p=UNDEFINED, .col=UNDEFINED, .collect_checker=UNDEFINED, .barrier=UNDEFINED, .gcommIndex=0}
    [junit] | | dyscope d72 (id=72, parent=d48, static=54)
    [junit] | | | variables
    [junit] | | | | curr_status = 2
    [junit] | | dyscope d43 (id=73, parent=d0, static=29)
    [junit] | | | variables
    [junit] | | | | datatype = 8
    [junit] | | dyscope d74 (id=74, parent=d0, static=42)
    [junit] | | | variables
    [junit] | | | | message = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 1}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | | | buf = &<d16>msg
    [junit] | | | | size = SIZEOF_INT
    [junit] | | dyscope d75 (id=75, parent=d0, static=41)
    [junit] | | | variables
    [junit] | | | | message = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 1}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | dyscope d76 (id=76, parent=d0, static=39)
    [junit] | | | variables
    [junit] | | | | message = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 1}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | dyscope d77 (id=77, parent=d0, static=40)
    [junit] | | | variables
    [junit] | | | | message = ($message){
    [junit] | | | | | .source=1, 
    [junit] | | | | | .dest=0, 
    [junit] | | | | | .tag=1, 
    [junit] | | | | | .data=(int[1]){
    [junit] | | | | | | 1}, 
    [junit] | | | | | .size=SIZEOF_INT}
    [junit] | | dyscope d78 (id=78, parent=d0, static=26)
    [junit] | | | variables
    [junit] | | | | buf = &<d16>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 8
    [junit] | | | | source = 1
    [junit] | | | | tag = 1
    [junit] | | | | comm = (MPI_Comm){.p2p=&<d6>heap.malloc5[0][0], .col=&<d6>heap.malloc5[1][0], .collect_checker=&<d6>heap.malloc3[0][0], .barrier=&<d6>heap.malloc1[0][0], .gcommIndex=0}
    [junit] | | | | status = &<d16>status
    [junit] | | dyscope d79 (id=79, parent=d78, static=50)
    [junit] | | | variables
    [junit] | | | | curr_status = 1
    [junit] | | | | $sef$1 = NULL
    [junit] | | dyscope d80 (id=80, parent=d0, static=37)
    [junit] | | | variables
    [junit] | | | | buf = &<d16>msg
    [junit] | | | | count = 1
    [junit] | | | | datatype = 8
    [junit] | | | | source = 1
    [junit] | | | | tag = 1
    [junit] | | | | comm = &<d6>heap.malloc5[0][0]
    [junit] | | | | status = &<d16>status
    [junit] | | dyscope d81 (id=81, parent=d80, static=56)
    [junit] | | | variables
    [junit] | | | | in = NULL
    [junit] | | | | $sef$3 = NULL
    [junit] | | | | size = NULL
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, MPItoCIVLTransformer:0.-1-20 "$parfor(int i: 0 ...." inserted by MPItoCIVLTransformer.$parfor MPI_Process before op.h:21.1-10 "Operation" included from civlc.cvh:11.9-15 "<op.h>" included from stdio.cvl:10.10-21 "<civlc.cvh>", dyscope=d0]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=CMPI_Recv, location=92, civl-mpi.cvl:143.18-31 "$comm_dequeue", dyscope=d81]
    [junit] | | | | Frame[function=MPI_Recv, location=31, mpi.cvl:83.9-18 "CMPI_Recv", dyscope=d79]
    [junit] | | | | Frame[function=_main, location=142, wildcardBad.c:23.4-12 "MPI_Recv", dyscope=d16]
    [junit] | | | | Frame[function=MPI_Process, location=126, GeneralTransformer:0.-1-20 "CIVL_argc, &_argv[..." inserted by GeneralTransformer.new main function before wildcardBad.c:6.14-18 "argc", dyscope=d13]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] 
    [junit] Violation of Deadlock found in State 169:
    [junit] A deadlock is possible:
    [junit]   Path condition: (0 <= SIZEOF_INT+-1) && (0 <= -1*X0+9) && (0 <= X0+-1)
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): terminated
    [junit] process p3 (id=3): terminated
    [junit] 
    [junit] Trace ends after 163 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] === Command ===
    [junit] civl replay examples/concurrency/wildcardBad.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.66
    [junit]    memory (bytes)      : 898105344
    [junit]    max process count   : 4
    [junit]    states              : 330
    [junit]    states Saved        : 170
    [junit]    valid calls         : 1204
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 4
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputBOUND=4 examples/concurrency/dining.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.13
    [junit]    memory (bytes)      : 898105344
    [junit]    max process count   : 5
    [junit]    states              : 430
    [junit]    states saved        : 292
    [junit]    state matches       : 167
    [junit]    transitions         : 596
    [junit]    trace steps         : 454
    [junit]    valid calls         : 4178
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 9
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 24:
    [junit] CIVL execution violation in  (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at mp_root.cvh:16.4-9 "$wait" included from ring1Bad.cvl:7.9-22 ""mp_root.cvh"":
    [junit] A potential or absolute deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_REAL+-1
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 30, mp_root.cvh:16.4-9 "$wait" included from ring1Bad.cvl:7.9-22 ""mp_root.cvh""
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 42, mp_proc.cvh:3.4-17 "$comm_enqueue" included from ring1Bad.cvl:10.11-24 ""mp_proc.cvh""
    [junit]   Enabling predicate: true
    [junit] ProcessState 2: at location 42, mp_proc.cvh:3.4-17 "$comm_enqueue" included from ring1Bad.cvl:10.11-24 ""mp_proc.cvh""
    [junit]   Enabling predicate: true
    [junit] ProcessState 3: at location 42, mp_proc.cvh:3.4-17 "$comm_enqueue" included from ring1Bad.cvl:10.11-24 ""mp_proc.cvh""
    [junit]   Enabling predicate: true
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   finalize at mp_root.cvh:16.4-9 "$wait" included from ring1Bad.cvl:7.9-22 ""mp_root.cvh"" called from
    [junit]   _CIVL_system at mp_root.cvh:24.4-12 "finalize" included from ring1Bad.cvl:7.9-22 ""mp_root.cvh""
    [junit] 
    [junit] process p1 (id=1):
    [junit]   send at mp_proc.cvh:3.4-17 "$comm_enqueue" included from ring1Bad.cvl:10.11-24 ""mp_proc.cvh"" called from
    [junit]   MPI_Process at ring1Bad.cvl:14.2-6 "send"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   send at mp_proc.cvh:3.4-17 "$comm_enqueue" included from ring1Bad.cvl:10.11-24 ""mp_proc.cvh"" called from
    [junit]   MPI_Process at ring1Bad.cvl:14.2-6 "send"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   send at mp_proc.cvh:3.4-17 "$comm_enqueue" included from ring1Bad.cvl:10.11-24 ""mp_proc.cvh"" called from
    [junit]   MPI_Process at ring1Bad.cvl:14.2-6 "send"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/ring1Bad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -deadlock=potential -inputNPROCS=3 examples/concurrency/ring1Bad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.11
    [junit]    memory (bytes)      : 898105344
    [junit]    max process count   : 4
    [junit]    states              : 60
    [junit]    states saved        : 27
    [junit]    state matches       : 0
    [junit]    transitions         : 59
    [junit]    trace steps         : 23
    [junit]    valid calls         : 119
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/ring1Bad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 59:
    [junit] CIVL execution violation in  (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at mp_root2.cvh:67.4-9 "$wait" included from ring2Bad.cvl:8.9-23 ""mp_root2.cvh"":
    [junit] A potential or absolute deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_REAL+-1
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 39, mp_root2.cvh:67.4-9 "$wait" included from ring2Bad.cvl:8.9-23 ""mp_root2.cvh""
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 72, mp_proc2.cvh:38.4-17 "$comm_enqueue" included from ring2Bad.cvl:11.9-23 ""mp_proc2.cvh""
    [junit]   Enabling predicate: true
    [junit] ProcessState 2: at location 72, mp_proc2.cvh:38.4-17 "$comm_enqueue" included from ring2Bad.cvl:11.9-23 ""mp_proc2.cvh""
    [junit]   Enabling predicate: true
    [junit] ProcessState 3: at location 72, mp_proc2.cvh:38.4-17 "$comm_enqueue" included from ring2Bad.cvl:11.9-23 ""mp_proc2.cvh""
    [junit]   Enabling predicate: true
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   finalize at mp_root2.cvh:67.4-9 "$wait" included from ring2Bad.cvl:8.9-23 ""mp_root2.cvh"" called from
    [junit]   _CIVL_system at mp_root2.cvh:73.2-10 "finalize" included from ring2Bad.cvl:8.9-23 ""mp_root2.cvh""
    [junit] 
    [junit] process p1 (id=1):
    [junit]   MPI_Send at mp_proc2.cvh:38.4-17 "$comm_enqueue" included from ring2Bad.cvl:11.9-23 ""mp_proc2.cvh"" called from
    [junit]   MPI_Process at ring2Bad.cvl:23.2-10 "MPI_Send"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   MPI_Send at mp_proc2.cvh:38.4-17 "$comm_enqueue" included from ring2Bad.cvl:11.9-23 ""mp_proc2.cvh"" called from
    [junit]   MPI_Process at ring2Bad.cvl:23.2-10 "MPI_Send"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   MPI_Send at mp_proc2.cvh:38.4-17 "$comm_enqueue" included from ring2Bad.cvl:11.9-23 ""mp_proc2.cvh"" called from
    [junit]   MPI_Process at ring2Bad.cvl:23.2-10 "MPI_Send"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/ring2Bad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -deadlock=potential -inputNPROCS=3 examples/concurrency/ring2Bad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.14
    [junit]    memory (bytes)      : 898105344
    [junit]    max process count   : 4
    [junit]    states              : 92
    [junit]    states saved        : 62
    [junit]    state matches       : 0
    [junit]    transitions         : 91
    [junit]    trace steps         : 58
    [junit]    valid calls         : 250
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/ring2Bad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 16:
    [junit] CIVL execution violation in  (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at ring3Bad.cvl:30.52-53 ";":
    [junit] A potential or absolute deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] ProcessState 0: at location 2, ring3Bad.cvl:30.52-53 ";"
    [junit]   Enabling predicate: false
    [junit] ProcessState 1: at location 24, ring3Bad.cvl:20.2-15 "$comm_enqueue"
    [junit]   Enabling predicate: true
    [junit] ProcessState 2: at location 24, ring3Bad.cvl:20.2-15 "$comm_enqueue"
    [junit]   Enabling predicate: true
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at ring3Bad.cvl:30.52-53 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   MPI_Process at ring3Bad.cvl:20.2-15 "$comm_enqueue"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   MPI_Process at ring3Bad.cvl:20.2-15 "$comm_enqueue"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/ring3Bad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -deadlock=potential examples/concurrency/ring3Bad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 898105344
    [junit]    max process count   : 3
    [junit]    states              : 33
    [junit]    states saved        : 22
    [junit]    state matches       : 0
    [junit]    transitions         : 32
    [junit]    trace steps         : 15
    [junit]    valid calls         : 111
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/ring3Bad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 27:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at adderBad.cvl:43.2-23 "$assert((seq == par))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] a=(real[4])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((seq==par))
    [junit] -> X1[1]+X1[2]+X1[3]+X1[0]==X1[1]+X1[3]+X1[0]
    [junit] -> 0==X1[2]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at adderBad.cvl:43.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/adderBad_0.trace
    [junit] Restricting search depth to 26
    [junit] 
    [junit] Violation 1 encountered at depth 23:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at adderBad.cvl:43.2-23 "$assert((seq == par))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=3
    [junit] a=(real[3])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((seq==par))
    [junit] -> X1[1]+X1[2]+X1[0]==X1[2]+X1[0]
    [junit] -> 0==X1[1]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at adderBad.cvl:43.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (23) is less than length of old (27): replacing old with new...
    [junit] Restricting search depth to 22
    [junit] 
    [junit] Violation 2 encountered at depth 18:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at adderBad.cvl:43.2-23 "$assert((seq == par))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=2
    [junit] a=(real[2])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((seq==par))
    [junit] -> X1[1]+X1[0]==X1[1]
    [junit] -> 0==X1[0]
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at adderBad.cvl:43.2-9 "$assert"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (18) is less than length of old (23): replacing old with new...
    [junit] Restricting search depth to 17
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=4 -min examples/concurrency/adderBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.27
    [junit]    memory (bytes)      : 898105344
    [junit]    max process count   : 5
    [junit]    states              : 2228
    [junit]    states saved        : 1186
    [junit]    state matches       : 619
    [junit]    transitions         : 2846
    [junit]    trace steps         : 1796
    [junit]    valid calls         : 19145
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 23
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/adderBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Error 0:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at adderBad.cvl:43.2-23 "$assert((seq == par))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=2
    [junit] a=(real[2])X1
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((seq==par))
    [junit] -> X1[1]+X1[0]==X1[1]
    [junit] -> 0==X1[0]
    [junit] State -1:104198
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | B = 4
    [junit] | | | | N = 2
    [junit] | | | | a = (real[2])X1
    [junit] | | dyscope d1 (id=1, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | | | seq = X1[1]+X1[0]
    [junit] | | | | par = X1[1]
    [junit] | | dyscope d2 (id=2, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | p = &<d0>a[0]
    [junit] | | | | n = 2
    [junit] | | dyscope d3 (id=3, parent=d2, static=6)
    [junit] | | | variables
    [junit] | | | | s = X1[1]+X1[0]
    [junit] | | dyscope d4 (id=4, parent=d3, static=7)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d5 (id=5, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | p = &<d0>a[0]
    [junit] | | | | n = 2
    [junit] | | dyscope d6 (id=6, parent=d5, static=8)
    [junit] | | | variables
    [junit] | | | | s = X1[1]
    [junit] | | | | _dom_size0 = 2
    [junit] | | | | _par_procs0 = (process[2]){UNDEFINED, UNDEFINED}
    [junit] | | dyscope d7 (id=7, parent=d6, static=9)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d8 (id=8, parent=d7, static=12)
    [junit] | | | variables
    [junit] | | | | t = X1[0]
    [junit] | | dyscope d9 (id=9, parent=d6, static=9)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d10 (id=10, parent=d9, static=12)
    [junit] | | | variables
    [junit] | | | | t = X1[1]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=6, adderBad.cvl:43.2-9 "$assert", dyscope=d1]
    [junit] | | process - (id=1): null
    [junit] | | process - (id=2): null
    [junit] 
    [junit] Trace ends after 18 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] === Command ===
    [junit] civl replay examples/concurrency/adderBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.1
    [junit]    memory (bytes)      : 898105344
    [junit]    max process count   : 3
    [junit]    states              : 31
    [junit]    states Saved        : 23
    [junit]    valid calls         : 111
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 15
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 205:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at mp_root2.cvh:67.4-9 "$wait" included from hybrid.cvl:6.9-23 ""mp_root2.cvh"":
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] process p5 (id=5): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   finalize at mp_root2.cvh:67.4-9 "$wait" included from hybrid.cvl:6.9-23 ""mp_root2.cvh"" called from
    [junit]   _CIVL_system at mp_root2.cvh:73.2-10 "finalize" included from hybrid.cvl:6.9-23 ""mp_root2.cvh""
    [junit] 
    [junit] process p1 (id=1):
    [junit]   MPI_Process at hybrid.cvl:39.26-31 "$wait"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   MPI_Process at hybrid.cvl:39.26-31 "$wait"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   MPI_Recv at mp_proc2.cvh:45.16-29 "$comm_dequeue" included from hybrid.cvl:10.9-23 ""mp_proc2.cvh"" called from
    [junit]   Thread at hybrid.cvl:29.10-18 "MPI_Recv"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   MPI_Recv at mp_proc2.cvh:45.16-29 "$comm_dequeue" included from hybrid.cvl:10.9-23 ""mp_proc2.cvh"" called from
    [junit]   Thread at hybrid.cvl:29.10-18 "MPI_Recv"
    [junit] 
    [junit] process p5 (id=5):
    [junit]   MPI_Recv at mp_proc2.cvh:45.16-29 "$comm_dequeue" included from hybrid.cvl:10.9-23 ""mp_proc2.cvh"" called from
    [junit]   Thread at hybrid.cvl:26.10-18 "MPI_Recv"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/hybrid_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputNPROCS=2 examples/concurrency/hybrid.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.67
    [junit]    memory (bytes)      : 898105344
    [junit]    max process count   : 7
    [junit]    states              : 6803
    [junit]    states saved        : 3651
    [junit]    state matches       : 145
    [junit]    transitions         : 6947
    [junit]    trace steps         : 3377
    [junit]    valid calls         : 31348
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/hybrid_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputNPROCS=5 -enablePrintf=false examples/concurrency/wildcard.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.67
    [junit]    memory (bytes)      : 886571008
    [junit]    max process count   : 6
    [junit]    states              : 1607
    [junit]    states saved        : 1090
    [junit]    state matches       : 23
    [junit]    transitions         : 1629
    [junit]    trace steps         : 1056
    [junit]    valid calls         : 6564
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/concurrency/locksGood.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 886571008
    [junit]    max process count   : 3
    [junit]    states              : 15
    [junit]    states saved        : 4
    [junit]    state matches       : 2
    [junit]    transitions         : 16
    [junit]    trace steps         : 5
    [junit]    valid calls         : 4
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputN=10 examples/concurrency/spawn2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 886571008
    [junit]    max process count   : 3
    [junit]    states              : 717
    [junit]    states saved        : 159
    [junit]    state matches       : 121
    [junit]    transitions         : 837
    [junit]    trace steps         : 279
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=4 examples/concurrency/barrier.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.4
    [junit]    memory (bytes)      : 886571008
    [junit]    max process count   : 5
    [junit]    states              : 9722
    [junit]    states saved        : 2958
    [junit]    state matches       : 2416
    [junit]    transitions         : 12137
    [junit]    trace steps         : 5367
    [junit]    valid calls         : 28422
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 13
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 57:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at mpi-pthreads.cvl:43.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] process p5 (id=5): terminated
    [junit] process p6 (id=6): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at mpi-pthreads.cvl:43.2-10 "$waitall"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   MPI_Process at mpi-pthreads.cvl:34.2-10 "$waitall"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   MPI_Process at mpi-pthreads.cvl:34.2-10 "$waitall"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   Thread at mpi-pthreads.cvl:26.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   Thread at mpi-pthreads.cvl:26.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p5 (id=5):
    [junit]   terminated
    [junit] 
    [junit] process p6 (id=6):
    [junit]   Thread at mpi-pthreads.cvl:24.37-50 "$comm_dequeue"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/mpi-pthreads_0.trace
    [junit] Restricting search depth to 56
    [junit] 
    [junit] Violation 1 encountered at depth 56:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at mpi-pthreads.cvl:43.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] process p5 (id=5): false
    [junit] process p6 (id=6): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at mpi-pthreads.cvl:43.2-10 "$waitall"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   MPI_Process at mpi-pthreads.cvl:34.2-10 "$waitall"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   MPI_Process at mpi-pthreads.cvl:34.2-10 "$waitall"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   Thread at mpi-pthreads.cvl:26.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   Thread at mpi-pthreads.cvl:26.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p5 (id=5):
    [junit]   Thread at mpi-pthreads.cvl:24.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p6 (id=6):
    [junit]   Thread at mpi-pthreads.cvl:24.37-50 "$comm_dequeue"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (56) is less than length of old (57): replacing old with new...
    [junit] Restricting search depth to 55
    [junit] 
    [junit] Violation 2 encountered at depth 44:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at mpi-pthreads.cvl:43.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] process p5 (id=5): false
    [junit] process p6 (id=6): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at mpi-pthreads.cvl:43.2-10 "$waitall"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   MPI_Process at mpi-pthreads.cvl:34.2-10 "$waitall"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   MPI_Process at mpi-pthreads.cvl:34.2-10 "$waitall"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   Thread at mpi-pthreads.cvl:26.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   Thread at mpi-pthreads.cvl:26.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p5 (id=5):
    [junit]   Thread at mpi-pthreads.cvl:24.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p6 (id=6):
    [junit]   Thread at mpi-pthreads.cvl:24.37-50 "$comm_dequeue"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (44) is less than length of old (56): replacing old with new...
    [junit] Restricting search depth to 43
    [junit] 
    [junit] === Command ===
    [junit] civl verify -min examples/concurrency/mpi-pthreads.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.22
    [junit]    memory (bytes)      : 886571008
    [junit]    max process count   : 7
    [junit]    states              : 1389
    [junit]    states saved        : 372
    [junit]    state matches       : 86
    [junit]    transitions         : 1474
    [junit]    trace steps         : 453
    [junit]    valid calls         : 6628
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/mpi-pthreads_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 79:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/diningBad_0.trace
    [junit] Restricting search depth to 78
    [junit] 
    [junit] Violation 1 encountered at depth 74:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (74) is less than length of old (79): replacing old with new...
    [junit] Restricting search depth to 73
    [junit] 
    [junit] Violation 2 encountered at depth 69:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (69) is less than length of old (74): replacing old with new...
    [junit] Restricting search depth to 68
    [junit] 
    [junit] Violation 3 encountered at depth 64:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (64) is less than length of old (69): replacing old with new...
    [junit] Restricting search depth to 63
    [junit] 
    [junit] Violation 4 encountered at depth 59:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (59) is less than length of old (64): replacing old with new...
    [junit] Restricting search depth to 58
    [junit] 
    [junit] Violation 5 encountered at depth 54:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (54) is less than length of old (59): replacing old with new...
    [junit] Restricting search depth to 53
    [junit] 
    [junit] Violation 6 encountered at depth 49:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (49) is less than length of old (54): replacing old with new...
    [junit] Restricting search depth to 48
    [junit] 
    [junit] Violation 7 encountered at depth 44:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (44) is less than length of old (49): replacing old with new...
    [junit] Restricting search depth to 43
    [junit] 
    [junit] Violation 8 encountered at depth 39:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (39) is less than length of old (44): replacing old with new...
    [junit] Restricting search depth to 38
    [junit] 
    [junit] Violation 9 encountered at depth 36:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (36) is less than length of old (39): replacing old with new...
    [junit] Restricting search depth to 35
    [junit] 
    [junit] Violation 10 encountered at depth 31:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (31) is less than length of old (36): replacing old with new...
    [junit] Restricting search depth to 30
    [junit] 
    [junit] Violation 11 encountered at depth 28:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (28) is less than length of old (31): replacing old with new...
    [junit] Restricting search depth to 27
    [junit] 
    [junit] Violation 12 encountered at depth 23:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at diningBad.cvl:32.11-12 ";":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at diningBad.cvl:32.11-12 ";"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   dine at diningBad.cvl:21.25-37 "forks[right]"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (23) is less than length of old (28): replacing old with new...
    [junit] Restricting search depth to 22
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=4 -min examples/concurrency/diningBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.18
    [junit]    memory (bytes)      : 886571008
    [junit]    max process count   : 5
    [junit]    states              : 243
    [junit]    states saved        : 230
    [junit]    state matches       : 155
    [junit]    transitions         : 578
    [junit]    trace steps         : 561
    [junit]    valid calls         : 6033
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 9
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/diningBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] State 23
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | B = 4
    [junit] | | | | n = 2
    [junit] | | | | forks = (boolean[2]){false, false}
    [junit] | | | | _dom_size0 = 2
    [junit] | | | | _par_procs0 = (process[2]){p1, p2}
    [junit] | | dyscope d1 (id=1, parent=d0, static=2)
    [junit] | | | variables
    [junit] | | | | x = 2
    [junit] | | dyscope d2 (id=2, parent=d1, static=7)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d3 (id=3, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | | | __LiteralDomain_counter0__ = NULL
    [junit] | | dyscope d4 (id=4, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d5 (id=5, parent=d4, static=8)
    [junit] | | | variables
    [junit] | | | | left = 0
    [junit] | | | | right = 1
    [junit] | | dyscope d6 (id=6, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d7 (id=7, parent=d6, static=8)
    [junit] | | | variables
    [junit] | | | | left = 1
    [junit] | | | | right = 0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=9, diningBad.cvl:32.11-12 ";", dyscope=d0]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=19, diningBad.cvl:21.25-37 "forks[right]", dyscope=d5]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=dine, location=19, diningBad.cvl:21.25-37 "forks[right]", dyscope=d7]
    [junit] 
    [junit] Violation of Deadlock found in State 23:
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Trace ends after 22 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] === Command ===
    [junit] civl replay examples/concurrency/diningBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 886571008
    [junit]    max process count   : 3
    [junit]    states              : 29
    [junit]    states Saved        : 24
    [junit]    valid calls         : 151
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 5
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputNUM_ACCOUNTS=3 examples/concurrency/bank.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 886571008
    [junit]    max process count   : 3
    [junit]    states              : 1139
    [junit]    states saved        : 605
    [junit]    state matches       : 82
    [junit]    transitions         : 1220
    [junit]    trace steps         : 686
    [junit]    valid calls         : 759
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -deadlock=potential -inputNPROCS_BOUND=8 -inputN_BOUND=4 examples/concurrency/ring.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.77
    [junit]    memory (bytes)      : 854589440
    [junit]    max process count   : 9
    [junit]    states              : 5559
    [junit]    states saved        : 3826
    [junit]    state matches       : 0
    [junit]    transitions         : 5558
    [junit]    trace steps         : 3309
    [junit]    valid calls         : 14290
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 35
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=5 examples/concurrency/adder.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.13
    [junit]    memory (bytes)      : 854589440
    [junit]    max process count   : 6
    [junit]    states              : 785
    [junit]    states saved        : 626
    [junit]    state matches       : 72
    [junit]    transitions         : 856
    [junit]    trace steps         : 687
    [junit]    valid calls         : 5120
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 21
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -deadlock=potential -inputNPROCS=3 examples/concurrency/ring1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 854589440
    [junit]    max process count   : 4
    [junit]    states              : 127
    [junit]    states saved        : 71
    [junit]    state matches       : 2
    [junit]    transitions         : 128
    [junit]    trace steps         : 65
    [junit]    valid calls         : 399
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -deadlock=potential -inputNPROCS=3 examples/concurrency/ring2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.15
    [junit]    memory (bytes)      : 854589440
    [junit]    max process count   : 4
    [junit]    states              : 228
    [junit]    states saved        : 163
    [junit]    state matches       : 2
    [junit]    transitions         : 229
    [junit]    trace steps         : 154
    [junit]    valid calls         : 857
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -deadlock=potential examples/concurrency/ring3.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.1
    [junit]    memory (bytes)      : 854589440
    [junit]    max process count   : 3
    [junit]    states              : 69
    [junit]    states saved        : 51
    [junit]    state matches       : 1
    [junit]    transitions         : 69
    [junit]    trace steps         : 42
    [junit]    valid calls         : 316
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputN=10 examples/concurrency/spawn.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 854589440
    [junit]    max process count   : 3
    [junit]    states              : 63
    [junit]    states saved        : 52
    [junit]    state matches       : 0
    [junit]    transitions         : 62
    [junit]    trace steps         : 51
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 1:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at waitSelf.cvl:4.1-6 "$wait":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at waitSelf.cvl:4.1-6 "$wait"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/waitSelf_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/concurrency/waitSelf.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 854589440
    [junit]    max process count   : 0
    [junit]    states              : 1
    [junit]    states saved        : 1
    [junit]    state matches       : 0
    [junit]    transitions         : 0
    [junit]    trace steps         : 0
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/waitSelf_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 73:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:44.26-31 "$wait":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/barrierBad_0.trace
    [junit] Restricting search depth to 72
    [junit] 
    [junit] Violation 1 encountered at depth 71:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 3==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:21.2-4 "if" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] Logging new entry 1, writing trace to CIVLREP/barrierBad_1.trace
    [junit] Restricting search depth to 70
    [junit] 
    [junit] Violation 2 encountered at depth 69:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 3==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:19.2-17 "in_barrier[tid]" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (69) is less than length of old (71): replacing old with new...
    [junit] Restricting search depth to 68
    [junit] 
    [junit] Violation 3 encountered at depth 67:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 2==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (67) is less than length of old (69): replacing old with new...
    [junit] Restricting search depth to 66
    [junit] 
    [junit] Violation 4 encountered at depth 65:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 2==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:21.2-4 "if" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:23.4-18 "num_in_barrier" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (65) is less than length of old (67): replacing old with new...
    [junit] Restricting search depth to 64
    [junit] 
    [junit] Violation 5 encountered at depth 63:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 2==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:21.2-4 "if" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (63) is less than length of old (65): replacing old with new...
    [junit] Restricting search depth to 62
    [junit] 
    [junit] Violation 6 encountered at depth 61:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 2==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:21.2-4 "if" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (61) is less than length of old (63): replacing old with new...
    [junit] Restricting search depth to 60
    [junit] 
    [junit] Violation 7 encountered at depth 59:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 2==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:19.2-17 "in_barrier[tid]" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (59) is less than length of old (61): replacing old with new...
    [junit] Restricting search depth to 58
    [junit] 
    [junit] Violation 8 encountered at depth 57:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 1==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (57) is less than length of old (59): replacing old with new...
    [junit] Restricting search depth to 56
    [junit] 
    [junit] Violation 9 encountered at depth 55:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=4
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 1==4
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (55) is less than length of old (57): replacing old with new...
    [junit] Restricting search depth to 54
    [junit] 
    [junit] Violation 10 encountered at depth 53:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=3
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 2==3
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:19.2-17 "in_barrier[tid]" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (53) is less than length of old (55): replacing old with new...
    [junit] Restricting search depth to 52
    [junit] 
    [junit] Violation 11 encountered at depth 51:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=3
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 1==3
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (51) is less than length of old (53): replacing old with new...
    [junit] Restricting search depth to 50
    [junit] 
    [junit] Violation 12 encountered at depth 48:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=3
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 1==3
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (48) is less than length of old (51): replacing old with new...
    [junit] Restricting search depth to 47
    [junit] 
    [junit] Violation 13 encountered at depth 46:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:34.4-27 "$assert((counter == N))":
    [junit] 
    [junit] Input variables:
    [junit] B=4
    [junit] N=3
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((counter==N))
    [junit] -> 1==3
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   run at barrierBad.cvl:34.4-11 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   barrier at barrierBad.cvl:22.28-41 "in_barrier[i]" called from
    [junit]   run at barrierBad.cvl:31.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 1
    [junit] Length of new trace (46) is less than length of old (48): replacing old with new...
    [junit] Restricting search depth to 45
    [junit] 
    [junit] Violation 14 encountered at depth 41:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at barrierBad.cvl:44.26-31 "$wait":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at barrierBad.cvl:44.26-31 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   barrier at barrierBad.cvl:25.30-31 ";" called from
    [junit]   run at barrierBad.cvl:33.4-11 "barrier"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (41) is less than length of old (73): replacing old with new...
    [junit] Restricting search depth to 40
    [junit] 
    [junit] === Command ===
    [junit] civl verify -min -inputB=4 examples/concurrency/barrierBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.22
    [junit]    memory (bytes)      : 1039138816
    [junit]    max process count   : 5
    [junit]    states              : 25988
    [junit]    states saved        : 13998
    [junit]    state matches       : 13924
    [junit]    transitions         : 39924
    [junit]    trace steps         : 27928
    [junit]    valid calls         : 61295
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 13
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/barrierBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] State 42
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | B = 4
    [junit] | | | | N = 2
    [junit] | | | | threads = (process[2]){p1, p2}
    [junit] | | | | in_barrier = (int[2]){1, 1}
    [junit] | | | | num_in_barrier = 1
    [junit] | | | | counter = 2
    [junit] | | dyscope d1 (id=1, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | dyscope d2 (id=2, parent=d1, static=9)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d3 (id=3, parent=d0, static=7)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d4 (id=4, parent=d0, static=6)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d5 (id=5, parent=d0, static=6)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | | dyscope d6 (id=6, parent=d0, static=8)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d7 (id=7, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d8 (id=8, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | | dyscope d9 (id=9, parent=d8, static=10)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d7 (id=10, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | | | tid = 0
    [junit] | | dyscope d8 (id=11, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | | | tid = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=14, barrierBad.cvl:44.26-31 "$wait", dyscope=d6]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d7]
    [junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=barrier, location=30, barrierBad.cvl:25.30-31 ";", dyscope=d8]
    [junit] | | | | Frame[function=run, location=36, barrierBad.cvl:33.4-11 "barrier", dyscope=d5]
    [junit] 
    [junit] Violation of Deadlock found in State 42:
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Trace ends after 40 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] === Command ===
    [junit] civl replay -id=0 examples/concurrency/barrierBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1039138816
    [junit]    max process count   : 3
    [junit]    states              : 63
    [junit]    states Saved        : 43
    [junit]    valid calls         : 152
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 9
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 57:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at mpi-pthreads.cvl:43.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: 0 <= SIZEOF_INT+-1
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] process p4 (id=4): false
    [junit] process p5 (id=5): terminated
    [junit] process p6 (id=6): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at mpi-pthreads.cvl:43.2-10 "$waitall"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   MPI_Process at mpi-pthreads.cvl:34.2-10 "$waitall"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   MPI_Process at mpi-pthreads.cvl:34.2-10 "$waitall"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   Thread at mpi-pthreads.cvl:26.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   Thread at mpi-pthreads.cvl:26.37-50 "$comm_dequeue"
    [junit] 
    [junit] process p5 (id=5):
    [junit]   terminated
    [junit] 
    [junit] process p6 (id=6):
    [junit]   Thread at mpi-pthreads.cvl:24.37-50 "$comm_dequeue"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/mpi-pthreads_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/concurrency/mpi-pthreads.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.14
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 7
    [junit]    states              : 866
    [junit]    states saved        : 252
    [junit]    state matches       : 46
    [junit]    transitions         : 911
    [junit]    trace steps         : 293
    [junit]    valid calls         : 4536
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/mpi-pthreads_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 47:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at blockAdderBad.cvl:46.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): terminated
    [junit] process p2 (id=2): false
    [junit] process p3 (id=3): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   adder_par at blockAdderBad.cvl:46.2-10 "$waitall" called from
    [junit]   _CIVL_system at blockAdderBad.cvl:52.19-28 "adder_par"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   terminated
    [junit] 
    [junit] process p2 (id=2):
    [junit]   run_worker at blockAdderBad.cvl:38.20-24 "lock"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   run_worker at blockAdderBad.cvl:38.20-24 "lock"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/blockAdderBad_0.trace
    [junit] Restricting search depth to 46
    [junit] 
    [junit] Violation 1 encountered at depth 41:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at blockAdderBad.cvl:46.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): terminated
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   adder_par at blockAdderBad.cvl:46.2-10 "$waitall" called from
    [junit]   _CIVL_system at blockAdderBad.cvl:52.19-28 "adder_par"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   terminated
    [junit] 
    [junit] process p2 (id=2):
    [junit]   run_worker at blockAdderBad.cvl:38.20-24 "lock"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (41) is less than length of old (47): replacing old with new...
    [junit] Restricting search depth to 40
    [junit] 
    [junit] Violation 2 encountered at depth 38:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at blockAdderBad.cvl:46.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): terminated
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   adder_par at blockAdderBad.cvl:46.2-10 "$waitall" called from
    [junit]   _CIVL_system at blockAdderBad.cvl:52.19-28 "adder_par"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   terminated
    [junit] 
    [junit] process p2 (id=2):
    [junit]   run_worker at blockAdderBad.cvl:38.20-24 "lock"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (38) is less than length of old (41): replacing old with new...
    [junit] Restricting search depth to 37
    [junit] 
    [junit] Violation 3 encountered at depth 35:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at blockAdderBad.cvl:46.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): terminated
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   adder_par at blockAdderBad.cvl:46.2-10 "$waitall" called from
    [junit]   _CIVL_system at blockAdderBad.cvl:52.19-28 "adder_par"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   terminated
    [junit] 
    [junit] process p2 (id=2):
    [junit]   run_worker at blockAdderBad.cvl:38.20-24 "lock"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (35) is less than length of old (38): replacing old with new...
    [junit] Restricting search depth to 34
    [junit] 
    [junit] Violation 4 encountered at depth 32:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at blockAdderBad.cvl:46.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): terminated
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   adder_par at blockAdderBad.cvl:46.2-10 "$waitall" called from
    [junit]   _CIVL_system at blockAdderBad.cvl:52.19-28 "adder_par"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   terminated
    [junit] 
    [junit] process p2 (id=2):
    [junit]   run_worker at blockAdderBad.cvl:38.20-24 "lock"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (32) is less than length of old (35): replacing old with new...
    [junit] Restricting search depth to 31
    [junit] 
    [junit] Violation 5 encountered at depth 29:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at blockAdderBad.cvl:46.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): terminated
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   adder_par at blockAdderBad.cvl:46.2-10 "$waitall" called from
    [junit]   _CIVL_system at blockAdderBad.cvl:52.19-28 "adder_par"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   terminated
    [junit] 
    [junit] process p2 (id=2):
    [junit]   run_worker at blockAdderBad.cvl:38.20-24 "lock"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (29) is less than length of old (32): replacing old with new...
    [junit] Restricting search depth to 28
    [junit] 
    [junit] Violation 6 encountered at depth 26:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at blockAdderBad.cvl:46.2-10 "$waitall":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): terminated
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   adder_par at blockAdderBad.cvl:46.2-10 "$waitall" called from
    [junit]   _CIVL_system at blockAdderBad.cvl:52.19-28 "adder_par"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   terminated
    [junit] 
    [junit] process p2 (id=2):
    [junit]   run_worker at blockAdderBad.cvl:38.20-24 "lock"
    [junit] 
    [junit] New log entry is equivalent to previously encountered entry 0
    [junit] Length of new trace (26) is less than length of old (29): replacing old with new...
    [junit] Restricting search depth to 25
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=6 -inputW=3 -min examples/concurrency/blockAdderBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.24
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 4
    [junit]    states              : 676
    [junit]    states saved        : 378
    [junit]    state matches       : 0
    [junit]    transitions         : 675
    [junit]    trace steps         : 343
    [junit]    valid calls         : 1375
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 31
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/blockAdderBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] State 28
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | B = 6
    [junit] | | | | W = 3
    [junit] | | | | N = 1
    [junit] | | | | P = 2
    [junit] | | | | a = (real[1])X2
    [junit] | | dyscope d1 (id=1, parent=d0, static=6)
    [junit] | | | variables
    [junit] | | | | sum_seq = X2[0]
    [junit] | | | | sum_par = NULL
    [junit] | | dyscope d2 (id=2, parent=d0, static=4)
    [junit] | | | variables
    [junit] | | dyscope d3 (id=3, parent=d2, static=7)
    [junit] | | | variables
    [junit] | | | | s = X2[0]
    [junit] | | dyscope d4 (id=4, parent=d3, static=8)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d5 (id=5, parent=d0, static=5)
    [junit] | | | variables
    [junit] | | dyscope d6 (id=6, parent=d5, static=9)
    [junit] | | | variables
    [junit] | | | | workers = (process[2]){p1, p2}
    [junit] | | | | lock = 1
    [junit] | | | | result = 0
    [junit] | | dyscope d7 (id=7, parent=d6, static=11)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d8 (id=8, parent=d6, static=12)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d9 (id=9, parent=d6, static=10)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d10 (id=10, parent=d9, static=13)
    [junit] | | | variables
    [junit] | | | | start = 0
    [junit] | | | | stop = 0
    [junit] | | | | localSum = 0
    [junit] | | dyscope d11 (id=11, parent=d6, static=10)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d12 (id=12, parent=d11, static=13)
    [junit] | | | variables
    [junit] | | | | start = 0
    [junit] | | | | stop = 1
    [junit] | | | | localSum = X2[0]
    [junit] | | dyscope d13 (id=13, parent=d10, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d14 (id=14, parent=d12, static=14)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=adder_par, location=27, blockAdderBad.cvl:46.2-10 "$waitall", dyscope=d6]
    [junit] | | | | Frame[function=_CIVL_system, location=8, blockAdderBad.cvl:52.19-28 "adder_par", dyscope=d1]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=run_worker, location=36, blockAdderBad.cvl:38.20-24 "lock", dyscope=d12]
    [junit] 
    [junit] Violation of Deadlock found in State 28:
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): terminated
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Trace ends after 25 transitions.
    [junit] Violation(s) found.
    [junit] 
    [junit] === Command ===
    [junit] civl replay examples/concurrency/blockAdderBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.1
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 3
    [junit]    states              : 50
    [junit]    states Saved        : 29
    [junit]    valid calls         : 120
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 15
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputB=6 -inputW=3 examples/concurrency/blockAdder.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.16
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 4
    [junit]    states              : 1178
    [junit]    states saved        : 537
    [junit]    state matches       : 36
    [junit]    transitions         : 1213
    [junit]    trace steps         : 538
    [junit]    valid calls         : 3021
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 31
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/concurrency/dlqueue.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 3
    [junit]    states              : 109
    [junit]    states saved        : 93
    [junit]    state matches       : 1
    [junit]    transitions         : 109
    [junit]    trace steps         : 88
    [junit]    valid calls         : 52
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 44:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at locksBad10.cvl:32.2-7 "$wait":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at locksBad10.cvl:32.2-7 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   f at locksBad10.cvl:12.17-18 "y"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   g at locksBad10.cvl:21.17-18 "x"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/locksBad10_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/concurrency/locksBad10.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 3
    [junit]    states              : 142
    [junit]    states saved        : 91
    [junit]    state matches       : 1
    [junit]    transitions         : 142
    [junit]    trace steps         : 91
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/locksBad10_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 6:
    [junit] CIVL execution violation (kind: DEADLOCK, certainty: PROVEABLE) 
    [junit] at locksBad.cvl:31.2-7 "$wait":
    [junit] A deadlock is possible:
    [junit]   Path condition: true
    [junit]   Enabling predicate: false
    [junit] process p0 (id=0): false
    [junit] process p1 (id=1): false
    [junit] process p2 (id=2): false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at locksBad.cvl:31.2-7 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   proc0 at locksBad.cvl:12.19-24 "lock1"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   proc1 at locksBad.cvl:21.19-24 "lock0"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/locksBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/concurrency/locksBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.09
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 3
    [junit]    states              : 12
    [junit]    states saved        : 9
    [junit]    state matches       : 1
    [junit]    transitions         : 12
    [junit]    trace steps         : 9
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/locksBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 5:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at spawnBad.cvl:23.2-19 "$assert((s1==s2))":
    [junit] 
    [junit] Input variables:
    [junit] N=10
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((s1==s2))
    [junit] -> 1==0
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at spawnBad.cvl:23.2-9 "$assert"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   f1 at spawnBad.cvl:11.26-28 "s1"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   f2 at spawnBad.cvl:15.2-4 "s2"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/spawnBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputN=10 examples/concurrency/spawnBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 3
    [junit]    states              : 727
    [junit]    states saved        : 162
    [junit]    state matches       : 123
    [junit]    transitions         : 850
    [junit]    trace steps         : 284
    [junit]    valid calls         : 5
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/spawnBad_log.txt
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.CudaTest
    [junit] Tests run: 2, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 1.615 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false -inputN=8 -inputNBLOCKS=4 examples/cuda/sum.cu 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.6
    [junit]    memory (bytes)      : 1030225920
    [junit]    max process count   : 14
    [junit]    states              : 1114
    [junit]    states saved        : 702
    [junit]    state matches       : 18
    [junit]    transitions         : 1131
    [junit]    trace steps         : 702
    [junit]    valid calls         : 15771
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 6
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false -inputN=2 -inputTILE_WIDTH=1  examples/cuda/matMult1.cu 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.01
    [junit]    memory (bytes)      : 1037565952
    [junit]    max process count   : 11
    [junit]    states              : 1864
    [junit]    states saved        : 1165
    [junit]    state matches       : 34
    [junit]    transitions         : 1897
    [junit]    trace steps         : 1163
    [junit]    valid calls         : 15126
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 10
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.GenTransformerTest
    [junit] Tests run: 4, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 1.384 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] ===================The program after linking and applying transformer is:===================
    [junit] //======================== civlc.cvh =======================
    [junit] typedef struct $proc $proc;
    [junit] typedef struct $scope $scope;
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] typedef struct $bundle $bundle;
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //===================== concurrency.cvh ====================
    [junit] typedef struct $gbarrier* $gbarrier;
    [junit] typedef struct $barrier* $barrier;
    [junit] $gbarrier $gbarrier_create($scope scope, int size);
    [junit] void $gbarrier_destroy($gbarrier barrier);
    [junit] $barrier $barrier_create($scope scope, $gbarrier gbarrier, int place);
    [junit] void $barrier_destroy($barrier barrier);
    [junit] typedef struct $collect_record $collect_record;
    [junit] typedef struct $gcollect_checker* $gcollect_checker;
    [junit] typedef struct $collect_checker* $collect_checker;
    [junit] $gcollect_checker $gcollect_checker_create($scope scope);
    [junit] void $gcollect_checker_destroy($gcollect_checker checker);
    [junit] $collect_checker $collect_checker_create($scope scope, $gcollect_checker gchecker);
    [junit] void $collect_checker_destroy($collect_checker checker);
    [junit] //========================== mpi.h =========================
    [junit] typedef enum $anon_enum_0{
    [junit]   MPI_CHAR,
    [junit]   MPI_CHARACTER,
    [junit]   MPI_SIGNED_CHAR,
    [junit]   MPI_UNSIGNED_CHAR,
    [junit]   MPI_BYTE,
    [junit]   MPI_WCHAR,
    [junit]   MPI_SHORT,
    [junit]   MPI_UNSIGNED_SHORT,
    [junit]   MPI_INT,
    [junit]   MPI_INT16_T,
    [junit]   MPI_INT32_T,
    [junit]   MPI_INT64_T,
    [junit]   MPI_INT8_T,
    [junit]   MPI_INTEGER,
    [junit]   MPI_INTEGER1,
    [junit]   MPI_INTEGER16,
    [junit]   MPI_INTEGER2,
    [junit]   MPI_INTEGER4,
    [junit]   MPI_INTEGER8,
    [junit]   MPI_UNSIGNED,
    [junit]   MPI_LONG,
    [junit]   MPI_UNSIGNED_LONG,
    [junit]   MPI_FLOAT,
    [junit]   MPI_DOUBLE,
    [junit]   MPI_LONG_DOUBLE,
    [junit]   MPI_LONG_LONG_INT,
    [junit]   MPI_UNSIGNED_LONG_LONG,
    [junit]   MPI_LONG_LONG,
    [junit]   MPI_PACKED,
    [junit]   MPI_LB,
    [junit]   MPI_UB,
    [junit]   MPI_UINT16_T,
    [junit]   MPI_UINT32_T,
    [junit]   MPI_UINT64_T,
    [junit]   MPI_UINT8_T,
    [junit]   MPI_FLOAT_INT,
    [junit]   MPI_DOUBLE_INT,
    [junit]   MPI_LONG_INT,
    [junit]   MPI_SHORT_INT,
    [junit]   MPI_2INT,
    [junit]   MPI_LONG_DOUBLE_INT,
    [junit]   MPI_AINT,
    [junit]   MPI_OFFSET,
    [junit]   MPI_2DOUBLE_PRECISION,
    [junit]   MPI_2INTEGER,
    [junit]   MPI_2REAL,
    [junit]   MPI_C_BOOL,
    [junit]   MPI_C_COMPLEX,
    [junit]   MPI_C_DOUBLE_COMPLEX,
    [junit]   MPI_C_FLOAT_COMPLEX,
    [junit]   MPI_C_LONG_DOUBLE_COMPLEX,
    [junit]   MPI_COMPLEX,
    [junit]   MPI_COMPLEX16,
    [junit]   MPI_COMPLEX32,
    [junit]   MPI_COMPLEX4,
    [junit]   MPI_COMPLEX8,
    [junit]   MPI_REAL,
    [junit]   MPI_REAL16,
    [junit]   MPI_REAL2,
    [junit]   MPI_REAL4,
    [junit]   MPI_REAL8
    [junit] } MPI_Datatype;
    [junit] typedef struct MPI_Comm MPI_Comm;
    [junit] typedef struct MPI_Status{
    [junit]     int MPI_SOURCE;
    [junit]     int MPI_TAG;
    [junit]     int MPI_ERROR;
    [junit]     int size;
    [junit] } MPI_Status;
    [junit] int MPI_Send(void*, int, MPI_Datatype, int, int, MPI_Comm);
    [junit] int MPI_Recv(void*, int, MPI_Datatype, int, int, MPI_Comm, MPI_Status*);
    [junit] int MPI_Comm_rank(MPI_Comm, int*);
    [junit] //======================== comm.cvh ========================
    [junit] typedef struct $message{
    [junit]     int source;
    [junit]     int dest;
    [junit]     int tag;
    [junit]     $bundle data;
    [junit]     int size;
    [junit] } $message;
    [junit] typedef struct $queue $queue;
    [junit] typedef struct $gcomm* $gcomm;
    [junit] typedef struct $comm* $comm;
    [junit] $message $message_pack(int source, int dest, int tag, void* data, int size);
    [junit] int $message_source($message message);
    [junit] int $message_tag($message message);
    [junit] int $message_size($message message);
    [junit] void $message_unpack($message message, void* buf, int size);
    [junit] $gcomm $gcomm_create($scope scope, int size);
    [junit] void $gcomm_destroy($gcomm gcomm);
    [junit] $comm $comm_create($scope scope, $gcomm gcomm, int place);
    [junit] void $comm_destroy($comm comm);
    [junit] int $comm_place($comm comm);
    [junit] void $comm_enqueue($comm comm, $message message);
    [junit] $message $comm_dequeue($comm comm, int source, int tag);
    [junit] //====================== civl-mpi.cvh ======================
    [junit] typedef enum __MPI_Sys_status__{
    [junit]   __UNINIT,
    [junit]   __INIT,
    [junit]   __FINALIZED
    [junit] } __MPI_Sys_status__;
    [junit] typedef struct MPI_Comm MPI_Comm;
    [junit] typedef struct CMPI_Gcomm CMPI_Gcomm;
    [junit] int sizeofDatatype(MPI_Datatype);
    [junit] void CMPI_Set_status(__MPI_Sys_status__ newStatus);
    [junit] __MPI_Sys_status__ CMPI_Get_status(void);
    [junit] CMPI_Gcomm CMPI_Gcomm_create($scope, int);
    [junit] void CMPI_Gcomm_destroy(CMPI_Gcomm);
    [junit] MPI_Comm CMPI_Comm_create($scope, CMPI_Gcomm, int);
    [junit] void CMPI_Comm_destroy(MPI_Comm);
    [junit] int _MPI_Init(void);
    [junit] int _MPI_Finalize(void);
    [junit] int CMPI_Send(void*, int, MPI_Datatype, int, int, $comm);
    [junit] int CMPI_Recv(void*, int, MPI_Datatype, int, int, $comm, MPI_Status*);
    [junit] void CMPI_AssertConsistentType(void* buf, MPI_Datatype datatype);
    [junit] //========================= mpi.cvl ========================
    [junit] struct MPI_Comm{
    [junit]     $comm p2p;
    [junit]     $comm col;
    [junit]     $collect_checker collect_checker;
    [junit]     $barrier barrier;
    [junit]     int gcommIndex;
    [junit] }
    [junit] int MPI_Comm_rank(MPI_Comm comm, int* rank)
    [junit] {
    [junit]   __MPI_Sys_status__ curr_status;
    [junit]   curr_status = CMPI_Get_status();
    [junit]   $assert(curr_status == __INIT, "MPI_Comm_rank() cannot be invoked without MPI_Init() being called before.\n");
    [junit]   *rank = $comm_place(comm.p2p);
    [junit]   return 0;
    [junit] }
    [junit] int MPI_Send(void* buf, int count, MPI_Datatype datatype, int dest, int tag, MPI_Comm comm)
    [junit] {
    [junit]   __MPI_Sys_status__ curr_status;
    [junit]   curr_status = CMPI_Get_status();
    [junit]   $assert(curr_status == __INIT, "MPI_Send() cannot be invoked without MPI_Init() being called before.\n");
    [junit]   CMPI_AssertConsistentType(buf, datatype);
    [junit]   int $sef$0 = CMPI_Send(buf, count, datatype, dest, tag, comm.p2p);
    [junit]   return $sef$0;
    [junit] }
    [junit] int MPI_Recv(void* buf, int count, MPI_Datatype datatype, int source, int tag, MPI_Comm comm, MPI_Status* status)
    [junit] {
    [junit]   __MPI_Sys_status__ curr_status;
    [junit]   curr_status = CMPI_Get_status();
    [junit]   $assert(curr_status == __INIT, "MPI_Recv() cannot be invoked without MPI_Init() being called before.\n");
    [junit]   CMPI_AssertConsistentType(buf, datatype);
    [junit]   int $sef$1 = CMPI_Recv(buf, count, datatype, source, tag, comm.p2p, status);
    [junit]   return $sef$1;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================== civlc.cvl =======================
    [junit] void $elaborate(int x)
    [junit] {
    [junit]   int i = 0;
    [junit]   for(; i < x; i = i + 1)
    [junit]     ;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //===================== concurrency.cvh ====================
    [junit] $gbarrier $gbarrier_create($scope scope, int size);
    [junit] void $gbarrier_destroy($gbarrier barrier);
    [junit] $barrier $barrier_create($scope scope, $gbarrier gbarrier, int place);
    [junit] void $barrier_destroy($barrier barrier);
    [junit] $gcollect_checker $gcollect_checker_create($scope scope);
    [junit] void $gcollect_checker_destroy($gcollect_checker checker);
    [junit] $collect_checker $collect_checker_create($scope scope, $gcollect_checker gchecker);
    [junit] void $collect_checker_destroy($collect_checker checker);
    [junit] //========================= seq.cvh ========================
    [junit] void $seq_init(void* array, int count, void* value);
    [junit] //===================== concurrency.cvl ====================
    [junit] struct $gbarrier{
    [junit]     int nprocs;
    [junit]     $proc  proc_map[];
    [junit]     _Bool  in_barrier[];
    [junit]     int num_in_barrier;
    [junit] }
    [junit] struct $barrier{
    [junit]     int place;
    [junit]     $gbarrier gbarrier;
    [junit] }
    [junit] struct $collect_record{
    [junit]     $bundle entries;
    [junit]     _Bool  marks[];
    [junit]     int numMarked;
    [junit] }
    [junit] struct $gcollect_checker{
    [junit]     int length;
    [junit]     $collect_record  records[];
    [junit] }
    [junit] struct $collect_checker{
    [junit]     $gcollect_checker checker;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //===================== concurrency.cvh ====================
    [junit] $gbarrier $gbarrier_create($scope scope, int size);
    [junit] void $gbarrier_destroy($gbarrier barrier);
    [junit] $barrier $barrier_create($scope scope, $gbarrier gbarrier, int place);
    [junit] void $barrier_destroy($barrier barrier);
    [junit] $gcollect_checker $gcollect_checker_create($scope scope);
    [junit] void $gcollect_checker_destroy($gcollect_checker checker);
    [junit] $collect_checker $collect_checker_create($scope scope, $gcollect_checker gchecker);
    [junit] void $collect_checker_destroy($collect_checker checker);
    [junit] //======================== comm.cvh ========================
    [junit] $message $message_pack(int source, int dest, int tag, void* data, int size);
    [junit] int $message_source($message message);
    [junit] int $message_tag($message message);
    [junit] int $message_size($message message);
    [junit] void $message_unpack($message message, void* buf, int size);
    [junit] $gcomm $gcomm_create($scope scope, int size);
    [junit] void $gcomm_destroy($gcomm gcomm);
    [junit] $comm $comm_create($scope scope, $gcomm gcomm, int place);
    [junit] void $comm_destroy($comm comm);
    [junit] int $comm_place($comm comm);
    [junit] void $comm_enqueue($comm comm, $message message);
    [junit] $message $comm_dequeue($comm comm, int source, int tag);
    [junit] //========================== mpi.h =========================
    [junit] int MPI_Send(void*, int, MPI_Datatype, int, int, MPI_Comm);
    [junit] int MPI_Recv(void*, int, MPI_Datatype, int, int, MPI_Comm, MPI_Status*);
    [junit] int MPI_Comm_rank(MPI_Comm, int*);
    [junit] //====================== civl-mpi.cvh ======================
    [junit] int sizeofDatatype(MPI_Datatype);
    [junit] void CMPI_Set_status(__MPI_Sys_status__ newStatus);
    [junit] __MPI_Sys_status__ CMPI_Get_status(void);
    [junit] CMPI_Gcomm CMPI_Gcomm_create($scope, int);
    [junit] void CMPI_Gcomm_destroy(CMPI_Gcomm);
    [junit] MPI_Comm CMPI_Comm_create($scope, CMPI_Gcomm, int);
    [junit] void CMPI_Comm_destroy(MPI_Comm);
    [junit] int _MPI_Init(void);
    [junit] int _MPI_Finalize(void);
    [junit] int CMPI_Send(void*, int, MPI_Datatype, int, int, $comm);
    [junit] int CMPI_Recv(void*, int, MPI_Datatype, int, int, $comm, MPI_Status*);
    [junit] void CMPI_AssertConsistentType(void* buf, MPI_Datatype datatype);
    [junit] //========================= seq.cvh ========================
    [junit] void $seq_init(void* array, int count, void* value);
    [junit] //====================== civl-mpi.cvl ======================
    [junit] struct CMPI_Gcomm{
    [junit]     $gcomm p2p;
    [junit]     $gcomm col;
    [junit]     $gcollect_checker collect_checker;
    [junit]     $gbarrier gbarrier;
    [junit] }
    [junit] int sizeofDatatype(MPI_Datatype datatype)
    [junit] {
    [junit]   switch(datatype)
    [junit]   {
    [junit]     case MPI_INT:
    [junit]       return sizeof(int);
    [junit]     case MPI_2INT:
    [junit]       return sizeof(int) * 2;
    [junit]     case MPI_FLOAT:
    [junit]       return sizeof(float);
    [junit]     case MPI_DOUBLE:
    [junit]       return sizeof(double);
    [junit]     case MPI_CHAR:
    [junit]       return sizeof(char);
    [junit]     case MPI_BYTE:
    [junit]       return sizeof(char);
    [junit]     case MPI_SHORT:
    [junit]       return sizeof(short);
    [junit]     case MPI_LONG:
    [junit]       return sizeof(long);
    [junit]     case MPI_LONG_DOUBLE:
    [junit]       return sizeof(long double);
    [junit]     case MPI_LONG_LONG_INT:
    [junit]       return sizeof(long long);
    [junit]     case MPI_LONG_LONG:
    [junit]       return sizeof(long long);
    [junit]     case MPI_UNSIGNED_LONG_LONG:
    [junit]       return sizeof(unsigned long long);
    [junit]     default:
    [junit]       $assert(0, "Unreachable");
    [junit]   }
    [junit] }
    [junit] CMPI_Gcomm CMPI_Gcomm_create($scope scope, int size)
    [junit] {
    [junit]   CMPI_Gcomm result;
    [junit]   result.p2p = $gcomm_create(scope, size);
    [junit]   result.col = $gcomm_create(scope, size);
    [junit]   result.collect_checker = $gcollect_checker_create(scope);
    [junit]   result.gbarrier = $gbarrier_create(scope, size);
    [junit]   return result;
    [junit] }
    [junit] void CMPI_Gcomm_destroy(CMPI_Gcomm gc)
    [junit] {
    [junit]   $gcomm_destroy(gc.p2p);
    [junit]   $gcomm_destroy(gc.col);
    [junit]   $gcollect_checker_destroy(gc.collect_checker);
    [junit]   $gbarrier_destroy(gc.gbarrier);
    [junit] }
    [junit] MPI_Comm CMPI_Comm_create($scope scope, CMPI_Gcomm gc, int rank)
    [junit] {
    [junit]   MPI_Comm result;
    [junit]   result.p2p = $comm_create(scope, gc.p2p, rank);
    [junit]   result.col = $comm_create(scope, gc.col, rank);
    [junit]   result.collect_checker = $collect_checker_create(scope, gc.collect_checker);
    [junit]   result.barrier = $barrier_create(scope, gc.gbarrier, rank);
    [junit]   result.gcommIndex = 0;
    [junit]   return result;
    [junit] }
    [junit] void CMPI_Comm_destroy(MPI_Comm comm)
    [junit] {
    [junit]   __MPI_Sys_status__ curr_status;
    [junit]   curr_status = CMPI_Get_status();
    [junit]   if(comm.gcommIndex == 0)
    [junit]     $assert(curr_status == __FINALIZED, "Process terminates without calling MPI_Finalize() first.");
    [junit]   $comm_destroy(comm.p2p);
    [junit]   $comm_destroy(comm.col);
    [junit]   $collect_checker_destroy(comm.collect_checker);
    [junit]   $barrier_destroy(comm.barrier);
    [junit] }
    [junit] int _MPI_Init(void)
    [junit] {
    [junit]   CMPI_Set_status(__INIT);
    [junit]   return 0;
    [junit] }
    [junit] int _MPI_Finalize(void)
    [junit] {
    [junit]   CMPI_Set_status(__FINALIZED);
    [junit]   return 0;
    [junit] }
    [junit] int CMPI_Send(void* buf, int count, MPI_Datatype datatype, int dest, int tag, $comm comm)
    [junit] {
    [junit]   if(dest >= 0)
    [junit]   {
    [junit]     int $sef$2 = sizeofDatatype(datatype);
    [junit]     int size = count * $sef$2;
    [junit]     int place = $comm_place(comm);
    [junit]     $message out = $message_pack(place, dest, tag, buf, size);
    [junit]     $comm_enqueue(comm, out);
    [junit]   }
    [junit]   return 0;
    [junit] }
    [junit] int CMPI_Recv(void* buf, int count, MPI_Datatype datatype, int source, int tag, $comm comm, MPI_Status* status)
    [junit] {
    [junit]   if((source >= 0) || (source == (-1)))
    [junit]   {
    [junit]     $message in = $comm_dequeue(comm, source, tag);
    [junit]     int $sef$3 = sizeofDatatype(datatype);
    [junit]     int size = count * $sef$3;
    [junit]     $message_unpack(in, buf, size);
    [junit]     if(status != (void*)0)
    [junit]     {
    [junit]       status->size = $message_size(in);
    [junit]       status->MPI_SOURCE = $message_source(in);
    [junit]       status->MPI_TAG = $message_tag(in);
    [junit]       status->MPI_ERROR = 0;
    [junit]     }
    [junit]   }
    [junit]   return 0;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //======================== comm.cvh ========================
    [junit] $message $message_pack(int source, int dest, int tag, void* data, int size);
    [junit] int $message_source($message message);
    [junit] int $message_tag($message message);
    [junit] int $message_size($message message);
    [junit] void $message_unpack($message message, void* buf, int size);
    [junit] $gcomm $gcomm_create($scope scope, int size);
    [junit] void $gcomm_destroy($gcomm gcomm);
    [junit] $comm $comm_create($scope scope, $gcomm gcomm, int place);
    [junit] void $comm_destroy($comm comm);
    [junit] int $comm_place($comm comm);
    [junit] void $comm_enqueue($comm comm, $message message);
    [junit] $message $comm_dequeue($comm comm, int source, int tag);
    [junit] //======================== comm.cvl ========================
    [junit] struct $queue{
    [junit]     int length;
    [junit]     $message  messages[];
    [junit] }
    [junit] struct $gcomm{
    [junit]     int nprocs;
    [junit]     $proc  procs[];
    [junit]     _Bool  isInit[];
    [junit]     $queue  buf[][];
    [junit] }
    [junit] struct $comm{
    [junit]     int place;
    [junit]     $gcomm gcomm;
    [junit] }
    [junit] $message $message_pack(int source, int dest, int tag, void* data, int size)
    [junit] {
    [junit]   $message result;
    [junit]   result.source = source;
    [junit]   result.dest = dest;
    [junit]   result.tag = tag;
    [junit]   result.data = $bundle_pack(data, size);
    [junit]   result.size = size;
    [junit]   return result;
    [junit] }
    [junit] int $message_source($message message)
    [junit] {
    [junit]   return message.source;
    [junit] }
    [junit] int $message_tag($message message)
    [junit] {
    [junit]   return message.tag;
    [junit] }
    [junit] int $message_size($message message)
    [junit] {
    [junit]   return message.size;
    [junit] }
    [junit] void $message_unpack($message message, void* buf, int size)
    [junit] {
    [junit]   $bundle_unpack(message.data, buf);
    [junit]   $assert(message.size <= size, "Message of size %d exceeds the specified size %d.", message.size, size);
    [junit] }
    [junit] int $comm_place($comm comm)
    [junit] {
    [junit]   return comm->place;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //========================= seq.cvh ========================
    [junit] void $seq_init(void* array, int count, void* value);
    [junit] //========================== mpi.h =========================
    [junit] int MPI_Send(void*, int, MPI_Datatype, int, int, MPI_Comm);
    [junit] int MPI_Recv(void*, int, MPI_Datatype, int, int, MPI_Comm, MPI_Status*);
    [junit] int MPI_Comm_rank(MPI_Comm, int*);
    [junit] //======================== assert.h ========================
    [junit] void assert(_Bool expr);
    [junit] //======================= simpleMPI.c ======================
    [junit] $input int CIVL_argc;
    [junit] $input char  CIVL_argv[10][];
    [junit] //================== MPItoCIVLTransformer ==================
    [junit] $input int _NPROCS;
    [junit] $input int _NPROCS_LOWER_BOUND;
    [junit] $input int _NPROCS_UPPER_BOUND;
    [junit] $assume((_NPROCS_LOWER_BOUND <= _NPROCS) && (_NPROCS <= _NPROCS_UPPER_BOUND));
    [junit] CMPI_Gcomm GCOMM_WORLD = CMPI_Gcomm_create($here, _NPROCS);
    [junit] CMPI_Gcomm  GCOMMS[];
    [junit] $seq_init(&GCOMMS, 1, &GCOMM_WORLD);
    [junit] void MPI_Process(int $mpi_rank)
    [junit] {
    [junit]   __MPI_Sys_status__ _my_status = __UNINIT;
    [junit]   $assert(_my_status == __UNINIT);
    [junit]   MPI_Comm MPI_COMM_WORLD = CMPI_Comm_create($here, GCOMM_WORLD, $mpi_rank);
    [junit]   void $assume(_Bool expression);
    [junit]   $assume((0 < CIVL_argc) && (CIVL_argc < 10));
    [junit]   int myrank;
    [junit]   int _main(int argc, char*  argv[])
    [junit]   {
    [junit]     double buf = 0.0;
    [junit]     _MPI_Init();
    [junit]     MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
    [junit]     if(myrank == 0)
    [junit]     {
    [junit]       buf = 1.0;
    [junit]       MPI_Send(&buf, 1, MPI_DOUBLE, 1, 0, MPI_COMM_WORLD);
    [junit]     }
    [junit]     else
    [junit]       MPI_Recv(&buf, 1, MPI_DOUBLE, 0, 0, MPI_COMM_WORLD, (void*)0);
    [junit]     assert(buf == 1.0);
    [junit]     _MPI_Finalize();
    [junit]   }
    [junit]   {
    [junit]     char*  _argv[10];
    [junit]     {
    [junit]       int i = 0;
    [junit]       for(; i < 10; i = i + 1)
    [junit]         _argv[i] = &CIVL_argv[i][0];
    [junit]     }
    [junit]     _main(CIVL_argc, &_argv[0]);
    [junit]   }
    [junit]   CMPI_Comm_destroy(MPI_COMM_WORLD);
    [junit] }
    [junit] int main()
    [junit] {
    [junit]   $elaborate(_NPROCS);
    [junit]   $parfor(int i: 0 .. _NPROCS - 1)
    [junit]     MPI_Process(i);
    [junit]   CMPI_Gcomm_destroy(GCOMM_WORLD);
    [junit] }
    [junit] 
    [junit] 
    [junit] === Command ===
    [junit] civl verify -input_NPROCS=2 -showProgram -enablePrintf=false examples/gen/simpleMPI.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.59
    [junit]    memory (bytes)      : 1037565952
    [junit]    max process count   : 3
    [junit]    states              : 224
    [junit]    states saved        : 106
    [junit]    state matches       : 0
    [junit]    transitions         : 223
    [junit]    trace steps         : 101
    [junit]    valid calls         : 677
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 6
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] ===================The program after linking and applying transformer is:===================
    [junit] //======================== civlc.cvh =======================
    [junit] typedef struct $proc $proc;
    [junit] typedef struct $scope $scope;
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] typedef struct $bundle $bundle;
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //===================== concurrency.cvh ====================
    [junit] typedef struct $gbarrier* $gbarrier;
    [junit] typedef struct $barrier* $barrier;
    [junit] $gbarrier $gbarrier_create($scope scope, int size);
    [junit] void $gbarrier_destroy($gbarrier barrier);
    [junit] $barrier $barrier_create($scope scope, $gbarrier gbarrier, int place);
    [junit] void $barrier_destroy($barrier barrier);
    [junit] typedef struct $collect_record $collect_record;
    [junit] typedef struct $gcollect_checker* $gcollect_checker;
    [junit] typedef struct $collect_checker* $collect_checker;
    [junit] $gcollect_checker $gcollect_checker_create($scope scope);
    [junit] void $gcollect_checker_destroy($gcollect_checker checker);
    [junit] $collect_checker $collect_checker_create($scope scope, $gcollect_checker gchecker);
    [junit] void $collect_checker_destroy($collect_checker checker);
    [junit] //========================== mpi.h =========================
    [junit] typedef enum $anon_enum_0{
    [junit]   MPI_CHAR,
    [junit]   MPI_CHARACTER,
    [junit]   MPI_SIGNED_CHAR,
    [junit]   MPI_UNSIGNED_CHAR,
    [junit]   MPI_BYTE,
    [junit]   MPI_WCHAR,
    [junit]   MPI_SHORT,
    [junit]   MPI_UNSIGNED_SHORT,
    [junit]   MPI_INT,
    [junit]   MPI_INT16_T,
    [junit]   MPI_INT32_T,
    [junit]   MPI_INT64_T,
    [junit]   MPI_INT8_T,
    [junit]   MPI_INTEGER,
    [junit]   MPI_INTEGER1,
    [junit]   MPI_INTEGER16,
    [junit]   MPI_INTEGER2,
    [junit]   MPI_INTEGER4,
    [junit]   MPI_INTEGER8,
    [junit]   MPI_UNSIGNED,
    [junit]   MPI_LONG,
    [junit]   MPI_UNSIGNED_LONG,
    [junit]   MPI_FLOAT,
    [junit]   MPI_DOUBLE,
    [junit]   MPI_LONG_DOUBLE,
    [junit]   MPI_LONG_LONG_INT,
    [junit]   MPI_UNSIGNED_LONG_LONG,
    [junit]   MPI_LONG_LONG,
    [junit]   MPI_PACKED,
    [junit]   MPI_LB,
    [junit]   MPI_UB,
    [junit]   MPI_UINT16_T,
    [junit]   MPI_UINT32_T,
    [junit]   MPI_UINT64_T,
    [junit]   MPI_UINT8_T,
    [junit]   MPI_FLOAT_INT,
    [junit]   MPI_DOUBLE_INT,
    [junit]   MPI_LONG_INT,
    [junit]   MPI_SHORT_INT,
    [junit]   MPI_2INT,
    [junit]   MPI_LONG_DOUBLE_INT,
    [junit]   MPI_AINT,
    [junit]   MPI_OFFSET,
    [junit]   MPI_2DOUBLE_PRECISION,
    [junit]   MPI_2INTEGER,
    [junit]   MPI_2REAL,
    [junit]   MPI_C_BOOL,
    [junit]   MPI_C_COMPLEX,
    [junit]   MPI_C_DOUBLE_COMPLEX,
    [junit]   MPI_C_FLOAT_COMPLEX,
    [junit]   MPI_C_LONG_DOUBLE_COMPLEX,
    [junit]   MPI_COMPLEX,
    [junit]   MPI_COMPLEX16,
    [junit]   MPI_COMPLEX32,
    [junit]   MPI_COMPLEX4,
    [junit]   MPI_COMPLEX8,
    [junit]   MPI_REAL,
    [junit]   MPI_REAL16,
    [junit]   MPI_REAL2,
    [junit]   MPI_REAL4,
    [junit]   MPI_REAL8
    [junit] } MPI_Datatype;
    [junit] typedef struct MPI_Comm MPI_Comm;
    [junit] typedef struct MPI_Status{
    [junit]     int MPI_SOURCE;
    [junit]     int MPI_TAG;
    [junit]     int MPI_ERROR;
    [junit]     int size;
    [junit] } MPI_Status;
    [junit] int MPI_Send(void*, int, MPI_Datatype, int, int, MPI_Comm);
    [junit] int MPI_Recv(void*, int, MPI_Datatype, int, int, MPI_Comm, MPI_Status*);
    [junit] int MPI_Comm_rank(MPI_Comm, int*);
    [junit] //======================== comm.cvh ========================
    [junit] typedef struct $message{
    [junit]     int source;
    [junit]     int dest;
    [junit]     int tag;
    [junit]     $bundle data;
    [junit]     int size;
    [junit] } $message;
    [junit] typedef struct $queue $queue;
    [junit] typedef struct $gcomm* $gcomm;
    [junit] typedef struct $comm* $comm;
    [junit] $message $message_pack(int source, int dest, int tag, void* data, int size);
    [junit] int $message_source($message message);
    [junit] int $message_tag($message message);
    [junit] int $message_size($message message);
    [junit] void $message_unpack($message message, void* buf, int size);
    [junit] $gcomm $gcomm_create($scope scope, int size);
    [junit] void $gcomm_destroy($gcomm gcomm);
    [junit] $comm $comm_create($scope scope, $gcomm gcomm, int place);
    [junit] void $comm_destroy($comm comm);
    [junit] int $comm_place($comm comm);
    [junit] void $comm_enqueue($comm comm, $message message);
    [junit] $message $comm_dequeue($comm comm, int source, int tag);
    [junit] //====================== civl-mpi.cvh ======================
    [junit] typedef enum __MPI_Sys_status__{
    [junit]   __UNINIT,
    [junit]   __INIT,
    [junit]   __FINALIZED
    [junit] } __MPI_Sys_status__;
    [junit] typedef struct MPI_Comm MPI_Comm;
    [junit] typedef struct CMPI_Gcomm CMPI_Gcomm;
    [junit] int sizeofDatatype(MPI_Datatype);
    [junit] void CMPI_Set_status(__MPI_Sys_status__ newStatus);
    [junit] __MPI_Sys_status__ CMPI_Get_status(void);
    [junit] CMPI_Gcomm CMPI_Gcomm_create($scope, int);
    [junit] void CMPI_Gcomm_destroy(CMPI_Gcomm);
    [junit] MPI_Comm CMPI_Comm_create($scope, CMPI_Gcomm, int);
    [junit] void CMPI_Comm_destroy(MPI_Comm);
    [junit] int _MPI_Init(void);
    [junit] int _MPI_Finalize(void);
    [junit] int CMPI_Send(void*, int, MPI_Datatype, int, int, $comm);
    [junit] int CMPI_Recv(void*, int, MPI_Datatype, int, int, $comm, MPI_Status*);
    [junit] void CMPI_AssertConsistentType(void* buf, MPI_Datatype datatype);
    [junit] //========================= mpi.cvl ========================
    [junit] struct MPI_Comm{
    [junit]     $comm p2p;
    [junit]     $comm col;
    [junit]     $collect_checker collect_checker;
    [junit]     $barrier barrier;
    [junit]     int gcommIndex;
    [junit] }
    [junit] int MPI_Comm_rank(MPI_Comm comm, int* rank)
    [junit] {
    [junit]   __MPI_Sys_status__ curr_status;
    [junit]   curr_status = CMPI_Get_status();
    [junit]   $assert(curr_status == __INIT, "MPI_Comm_rank() cannot be invoked without MPI_Init() being called before.\n");
    [junit]   *rank = $comm_place(comm.p2p);
    [junit]   return 0;
    [junit] }
    [junit] int MPI_Send(void* buf, int count, MPI_Datatype datatype, int dest, int tag, MPI_Comm comm)
    [junit] {
    [junit]   __MPI_Sys_status__ curr_status;
    [junit]   curr_status = CMPI_Get_status();
    [junit]   $assert(curr_status == __INIT, "MPI_Send() cannot be invoked without MPI_Init() being called before.\n");
    [junit]   CMPI_AssertConsistentType(buf, datatype);
    [junit]   int $sef$0 = CMPI_Send(buf, count, datatype, dest, tag, comm.p2p);
    [junit]   return $sef$0;
    [junit] }
    [junit] int MPI_Recv(void* buf, int count, MPI_Datatype datatype, int source, int tag, MPI_Comm comm, MPI_Status* status)
    [junit] {
    [junit]   __MPI_Sys_status__ curr_status;
    [junit]   curr_status = CMPI_Get_status();
    [junit]   $assert(curr_status == __INIT, "MPI_Recv() cannot be invoked without MPI_Init() being called before.\n");
    [junit]   CMPI_AssertConsistentType(buf, datatype);
    [junit]   int $sef$1 = CMPI_Recv(buf, count, datatype, source, tag, comm.p2p, status);
    [junit]   return $sef$1;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================== civlc.cvl =======================
    [junit] void $elaborate(int x)
    [junit] {
    [junit]   int i = 0;
    [junit]   for(; i < x; i = i + 1)
    [junit]     ;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //===================== concurrency.cvh ====================
    [junit] $gbarrier $gbarrier_create($scope scope, int size);
    [junit] void $gbarrier_destroy($gbarrier barrier);
    [junit] $barrier $barrier_create($scope scope, $gbarrier gbarrier, int place);
    [junit] void $barrier_destroy($barrier barrier);
    [junit] $gcollect_checker $gcollect_checker_create($scope scope);
    [junit] void $gcollect_checker_destroy($gcollect_checker checker);
    [junit] $collect_checker $collect_checker_create($scope scope, $gcollect_checker gchecker);
    [junit] void $collect_checker_destroy($collect_checker checker);
    [junit] //========================= seq.cvh ========================
    [junit] void $seq_init(void* array, int count, void* value);
    [junit] //===================== concurrency.cvl ====================
    [junit] struct $gbarrier{
    [junit]     int nprocs;
    [junit]     $proc  proc_map[];
    [junit]     _Bool  in_barrier[];
    [junit]     int num_in_barrier;
    [junit] }
    [junit] struct $barrier{
    [junit]     int place;
    [junit]     $gbarrier gbarrier;
    [junit] }
    [junit] struct $collect_record{
    [junit]     $bundle entries;
    [junit]     _Bool  marks[];
    [junit]     int numMarked;
    [junit] }
    [junit] struct $gcollect_checker{
    [junit]     int length;
    [junit]     $collect_record  records[];
    [junit] }
    [junit] struct $collect_checker{
    [junit]     $gcollect_checker checker;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //===================== concurrency.cvh ====================
    [junit] $gbarrier $gbarrier_create($scope scope, int size);
    [junit] void $gbarrier_destroy($gbarrier barrier);
    [junit] $barrier $barrier_create($scope scope, $gbarrier gbarrier, int place);
    [junit] void $barrier_destroy($barrier barrier);
    [junit] $gcollect_checker $gcollect_checker_create($scope scope);
    [junit] void $gcollect_checker_destroy($gcollect_checker checker);
    [junit] $collect_checker $collect_checker_create($scope scope, $gcollect_checker gchecker);
    [junit] void $collect_checker_destroy($collect_checker checker);
    [junit] //======================== comm.cvh ========================
    [junit] $message $message_pack(int source, int dest, int tag, void* data, int size);
    [junit] int $message_source($message message);
    [junit] int $message_tag($message message);
    [junit] int $message_size($message message);
    [junit] void $message_unpack($message message, void* buf, int size);
    [junit] $gcomm $gcomm_create($scope scope, int size);
    [junit] void $gcomm_destroy($gcomm gcomm);
    [junit] $comm $comm_create($scope scope, $gcomm gcomm, int place);
    [junit] void $comm_destroy($comm comm);
    [junit] int $comm_place($comm comm);
    [junit] void $comm_enqueue($comm comm, $message message);
    [junit] $message $comm_dequeue($comm comm, int source, int tag);
    [junit] //========================== mpi.h =========================
    [junit] int MPI_Send(void*, int, MPI_Datatype, int, int, MPI_Comm);
    [junit] int MPI_Recv(void*, int, MPI_Datatype, int, int, MPI_Comm, MPI_Status*);
    [junit] int MPI_Comm_rank(MPI_Comm, int*);
    [junit] //====================== civl-mpi.cvh ======================
    [junit] int sizeofDatatype(MPI_Datatype);
    [junit] void CMPI_Set_status(__MPI_Sys_status__ newStatus);
    [junit] __MPI_Sys_status__ CMPI_Get_status(void);
    [junit] CMPI_Gcomm CMPI_Gcomm_create($scope, int);
    [junit] void CMPI_Gcomm_destroy(CMPI_Gcomm);
    [junit] MPI_Comm CMPI_Comm_create($scope, CMPI_Gcomm, int);
    [junit] void CMPI_Comm_destroy(MPI_Comm);
    [junit] int _MPI_Init(void);
    [junit] int _MPI_Finalize(void);
    [junit] int CMPI_Send(void*, int, MPI_Datatype, int, int, $comm);
    [junit] int CMPI_Recv(void*, int, MPI_Datatype, int, int, $comm, MPI_Status*);
    [junit] void CMPI_AssertConsistentType(void* buf, MPI_Datatype datatype);
    [junit] //========================= seq.cvh ========================
    [junit] void $seq_init(void* array, int count, void* value);
    [junit] //====================== civl-mpi.cvl ======================
    [junit] struct CMPI_Gcomm{
    [junit]     $gcomm p2p;
    [junit]     $gcomm col;
    [junit]     $gcollect_checker collect_checker;
    [junit]     $gbarrier gbarrier;
    [junit] }
    [junit] int sizeofDatatype(MPI_Datatype datatype)
    [junit] {
    [junit]   switch(datatype)
    [junit]   {
    [junit]     case MPI_INT:
    [junit]       return sizeof(int);
    [junit]     case MPI_2INT:
    [junit]       return sizeof(int) * 2;
    [junit]     case MPI_FLOAT:
    [junit]       return sizeof(float);
    [junit]     case MPI_DOUBLE:
    [junit]       return sizeof(double);
    [junit]     case MPI_CHAR:
    [junit]       return sizeof(char);
    [junit]     case MPI_BYTE:
    [junit]       return sizeof(char);
    [junit]     case MPI_SHORT:
    [junit]       return sizeof(short);
    [junit]     case MPI_LONG:
    [junit]       return sizeof(long);
    [junit]     case MPI_LONG_DOUBLE:
    [junit]       return sizeof(long double);
    [junit]     case MPI_LONG_LONG_INT:
    [junit]       return sizeof(long long);
    [junit]     case MPI_LONG_LONG:
    [junit]       return sizeof(long long);
    [junit]     case MPI_UNSIGNED_LONG_LONG:
    [junit]       return sizeof(unsigned long long);
    [junit]     default:
    [junit]       $assert(0, "Unreachable");
    [junit]   }
    [junit] }
    [junit] CMPI_Gcomm CMPI_Gcomm_create($scope scope, int size)
    [junit] {
    [junit]   CMPI_Gcomm result;
    [junit]   result.p2p = $gcomm_create(scope, size);
    [junit]   result.col = $gcomm_create(scope, size);
    [junit]   result.collect_checker = $gcollect_checker_create(scope);
    [junit]   result.gbarrier = $gbarrier_create(scope, size);
    [junit]   return result;
    [junit] }
    [junit] void CMPI_Gcomm_destroy(CMPI_Gcomm gc)
    [junit] {
    [junit]   $gcomm_destroy(gc.p2p);
    [junit]   $gcomm_destroy(gc.col);
    [junit]   $gcollect_checker_destroy(gc.collect_checker);
    [junit]   $gbarrier_destroy(gc.gbarrier);
    [junit] }
    [junit] MPI_Comm CMPI_Comm_create($scope scope, CMPI_Gcomm gc, int rank)
    [junit] {
    [junit]   MPI_Comm result;
    [junit]   result.p2p = $comm_create(scope, gc.p2p, rank);
    [junit]   result.col = $comm_create(scope, gc.col, rank);
    [junit]   result.collect_checker = $collect_checker_create(scope, gc.collect_checker);
    [junit]   result.barrier = $barrier_create(scope, gc.gbarrier, rank);
    [junit]   result.gcommIndex = 0;
    [junit]   return result;
    [junit] }
    [junit] void CMPI_Comm_destroy(MPI_Comm comm)
    [junit] {
    [junit]   __MPI_Sys_status__ curr_status;
    [junit]   curr_status = CMPI_Get_status();
    [junit]   if(comm.gcommIndex == 0)
    [junit]     $assert(curr_status == __FINALIZED, "Process terminates without calling MPI_Finalize() first.");
    [junit]   $comm_destroy(comm.p2p);
    [junit]   $comm_destroy(comm.col);
    [junit]   $collect_checker_destroy(comm.collect_checker);
    [junit]   $barrier_destroy(comm.barrier);
    [junit] }
    [junit] int _MPI_Init(void)
    [junit] {
    [junit]   CMPI_Set_status(__INIT);
    [junit]   return 0;
    [junit] }
    [junit] int _MPI_Finalize(void)
    [junit] {
    [junit]   CMPI_Set_status(__FINALIZED);
    [junit]   return 0;
    [junit] }
    [junit] int CMPI_Send(void* buf, int count, MPI_Datatype datatype, int dest, int tag, $comm comm)
    [junit] {
    [junit]   if(dest >= 0)
    [junit]   {
    [junit]     int $sef$2 = sizeofDatatype(datatype);
    [junit]     int size = count * $sef$2;
    [junit]     int place = $comm_place(comm);
    [junit]     $message out = $message_pack(place, dest, tag, buf, size);
    [junit]     $comm_enqueue(comm, out);
    [junit]   }
    [junit]   return 0;
    [junit] }
    [junit] int CMPI_Recv(void* buf, int count, MPI_Datatype datatype, int source, int tag, $comm comm, MPI_Status* status)
    [junit] {
    [junit]   if((source >= 0) || (source == (-1)))
    [junit]   {
    [junit]     $message in = $comm_dequeue(comm, source, tag);
    [junit]     int $sef$3 = sizeofDatatype(datatype);
    [junit]     int size = count * $sef$3;
    [junit]     $message_unpack(in, buf, size);
    [junit]     if(status != (void*)0)
    [junit]     {
    [junit]       status->size = $message_size(in);
    [junit]       status->MPI_SOURCE = $message_source(in);
    [junit]       status->MPI_TAG = $message_tag(in);
    [junit]       status->MPI_ERROR = 0;
    [junit]     }
    [junit]   }
    [junit]   return 0;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //======================== comm.cvh ========================
    [junit] $message $message_pack(int source, int dest, int tag, void* data, int size);
    [junit] int $message_source($message message);
    [junit] int $message_tag($message message);
    [junit] int $message_size($message message);
    [junit] void $message_unpack($message message, void* buf, int size);
    [junit] $gcomm $gcomm_create($scope scope, int size);
    [junit] void $gcomm_destroy($gcomm gcomm);
    [junit] $comm $comm_create($scope scope, $gcomm gcomm, int place);
    [junit] void $comm_destroy($comm comm);
    [junit] int $comm_place($comm comm);
    [junit] void $comm_enqueue($comm comm, $message message);
    [junit] $message $comm_dequeue($comm comm, int source, int tag);
    [junit] //======================== comm.cvl ========================
    [junit] struct $queue{
    [junit]     int length;
    [junit]     $message  messages[];
    [junit] }
    [junit] struct $gcomm{
    [junit]     int nprocs;
    [junit]     $proc  procs[];
    [junit]     _Bool  isInit[];
    [junit]     $queue  buf[][];
    [junit] }
    [junit] struct $comm{
    [junit]     int place;
    [junit]     $gcomm gcomm;
    [junit] }
    [junit] $message $message_pack(int source, int dest, int tag, void* data, int size)
    [junit] {
    [junit]   $message result;
    [junit]   result.source = source;
    [junit]   result.dest = dest;
    [junit]   result.tag = tag;
    [junit]   result.data = $bundle_pack(data, size);
    [junit]   result.size = size;
    [junit]   return result;
    [junit] }
    [junit] int $message_source($message message)
    [junit] {
    [junit]   return message.source;
    [junit] }
    [junit] int $message_tag($message message)
    [junit] {
    [junit]   return message.tag;
    [junit] }
    [junit] int $message_size($message message)
    [junit] {
    [junit]   return message.size;
    [junit] }
    [junit] void $message_unpack($message message, void* buf, int size)
    [junit] {
    [junit]   $bundle_unpack(message.data, buf);
    [junit]   $assert(message.size <= size, "Message of size %d exceeds the specified size %d.", message.size, size);
    [junit] }
    [junit] int $comm_place($comm comm)
    [junit] {
    [junit]   return comm->place;
    [junit] }
    [junit] //======================== civlc.cvh =======================
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] void $assert(_Bool expr, ...);
    [junit] void $assume(_Bool expr);
    [junit] void $elaborate(int x);
    [junit] //======================= bundle.cvh =======================
    [junit] $bundle $bundle_pack(void* ptr, int size);
    [junit] void $bundle_unpack($bundle bundle, void* ptr);
    [junit] //========================= seq.cvh ========================
    [junit] void $seq_init(void* array, int count, void* value);
    [junit] //========================== mpi.h =========================
    [junit] int MPI_Send(void*, int, MPI_Datatype, int, int, MPI_Comm);
    [junit] int MPI_Recv(void*, int, MPI_Datatype, int, int, MPI_Comm, MPI_Status*);
    [junit] int MPI_Comm_rank(MPI_Comm, int*);
    [junit] //======================== assert.h ========================
    [junit] void assert(_Bool expr);
    [junit] //================== MPItoCIVLTransformer ==================
    [junit] $input int _NPROCS;
    [junit] $input int _NPROCS_LOWER_BOUND;
    [junit] $input int _NPROCS_UPPER_BOUND;
    [junit] $assume((_NPROCS_LOWER_BOUND <= _NPROCS) && (_NPROCS <= _NPROCS_UPPER_BOUND));
    [junit] CMPI_Gcomm GCOMM_WORLD = CMPI_Gcomm_create($here, _NPROCS);
    [junit] CMPI_Gcomm  GCOMMS[];
    [junit] $seq_init(&GCOMMS, 1, &GCOMM_WORLD);
    [junit] void MPI_Process(int $mpi_rank)
    [junit] {
    [junit]   __MPI_Sys_status__ _my_status = __UNINIT;
    [junit]   $assert(_my_status == __UNINIT);
    [junit]   MPI_Comm MPI_COMM_WORLD = CMPI_Comm_create($here, GCOMM_WORLD, $mpi_rank);
    [junit]   int myrank;
    [junit]   int _main()
    [junit]   {
    [junit]     double buf = 0.0;
    [junit]     _MPI_Init();
    [junit]     MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
    [junit]     if(myrank == 0)
    [junit]     {
    [junit]       buf = 1.0;
    [junit]       MPI_Send(&buf, 1, MPI_DOUBLE, 1, 0, MPI_COMM_WORLD);
    [junit]     }
    [junit]     else
    [junit]       MPI_Recv(&buf, 1, MPI_DOUBLE, 0, 0, MPI_COMM_WORLD, (void*)0);
    [junit]     assert(buf == 1.0);
    [junit]     _MPI_Finalize();
    [junit]   }
    [junit]   _main();
    [junit]   CMPI_Comm_destroy(MPI_COMM_WORLD);
    [junit] }
    [junit] int main()
    [junit] {
    [junit]   $elaborate(_NPROCS);
    [junit]   $parfor(int i: 0 .. _NPROCS - 1)
    [junit]     MPI_Process(i);
    [junit]   CMPI_Gcomm_destroy(GCOMM_WORLD);
    [junit] }
    [junit] 
    [junit] 
    [junit] === Command ===
    [junit] civl verify -showProgram -input_NPROCS=2 -enablePrintf=false examples/gen/simpleMPI2.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.71
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 3
    [junit]    states              : 154
    [junit]    states saved        : 80
    [junit]    state matches       : 0
    [junit]    transitions         : 153
    [junit]    trace steps         : 77
    [junit]    valid calls         : 517
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] ===================The program after linking and applying transformer is:===================
    [junit] //========================== gen.c =========================
    [junit] $input int CIVL_argc;
    [junit] $input char  CIVL_argv[10][];
    [junit] void $assume(_Bool expression);
    [junit] $assume((0 < CIVL_argc) && (CIVL_argc < 10));
    [junit] int sum(int k)
    [junit] {
    [junit]   return ((1 + k) * k) / 2;
    [junit] }
    [junit] int _main(int argc, char*  argv[])
    [junit] {
    [junit]   int a = 9;
    [junit]   a = sum(a);
    [junit]   return 0;
    [junit] }
    [junit] int main()
    [junit] {
    [junit]   char*  _argv[10];
    [junit]   {
    [junit]     int i = 0;
    [junit]     for(; i < 10; i = i + 1)
    [junit]       _argv[i] = &CIVL_argv[i][0];
    [junit]   }
    [junit]   _main(CIVL_argc, &_argv[0]);
    [junit] }
    [junit] 
    [junit] 
    [junit] === Command ===
    [junit] civl verify -showProgram -enablePrintf=false examples/gen/gen.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 43
    [junit]    states saved        : 16
    [junit]    state matches       : 0
    [junit]    transitions         : 42
    [junit]    trace steps         : 14
    [junit]    valid calls         : 6
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] ===================The program after linking and applying transformer is:===================
    [junit] //========================== gen.c =========================
    [junit] $input int CIVL_argc;
    [junit] $input char  CIVL_argv[10][];
    [junit] void $assume(_Bool expression);
    [junit] $assume((0 < CIVL_argc) && (CIVL_argc < 10));
    [junit] int sum(int k)
    [junit] {
    [junit]   return ((1 + k) * k) / 2;
    [junit] }
    [junit] int _main(int argc, char*  argv[])
    [junit] {
    [junit]   int a = 9;
    [junit]   a = sum(a);
    [junit]   return 0;
    [junit] }
    [junit] int main()
    [junit] {
    [junit]   char*  _argv[10];
    [junit]   {
    [junit]     int i = 0;
    [junit]     for(; i < 10; i = i + 1)
    [junit]       _argv[i] = &CIVL_argv[i][0];
    [junit]   }
    [junit]   _main(CIVL_argc, &_argv[0]);
    [junit] }
    [junit] 
    [junit] 
    [junit] === Command ===
    [junit] civl verify -showProgram -inputCIVL_argc=5 examples/gen/gen.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 43
    [junit]    states saved        : 15
    [junit]    state matches       : 0
    [junit]    transitions         : 42
    [junit]    trace steps         : 14
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.IOTransformerTest
    [junit] Tests run: 3, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 0.167 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/io/io.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 9
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 3
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/io/fscanf.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 55
    [junit]    states saved        : 31
    [junit]    state matches       : 0
    [junit]    transitions         : 54
    [junit]    trace steps         : 28
    [junit]    valid calls         : 22
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/io/defaultLength.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 21
    [junit]    states saved        : 16
    [junit]    state matches       : 0
    [junit]    transitions         : 20
    [junit]    trace steps         : 14
    [junit]    valid calls         : 17
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] ------------- ---------------- ---------------
    [junit] Testsuite: edu.udel.cis.vsl.civl.LanguageFeaturesTest
    [junit] Tests run: 105, Failures: 0, Errors: 0, Skipped: 1, Time elapsed: 7.477 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OUTPUT_READ, certainty: PROVEABLE) 
    [junit] at outputBad.cvl:17.11-12 "p":
    [junit] Attempt to read output variable k
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at outputBad.cvl:16.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/outputBad_0.trace
    [junit] 
    [junit] Violation 1 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OUTPUT_READ, certainty: CONCRETE) 
    [junit] at outputBad.cvl:18.7-8 "x":
    [junit] Attempt to read the output variable x
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at outputBad.cvl:16.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 1, writing trace to CIVLREP/outputBad_1.trace
    [junit] 
    [junit] Violation 2 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE) 
    [junit] at outputBad.cvl:19.7-9 "ka":
    [junit] Attempt to read uninitialized variable ka
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at outputBad.cvl:16.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 2, writing trace to CIVLREP/outputBad_2.trace
    [junit] 
    [junit] === Command ===
    [junit] civl verify -errorBound=5 examples/languageFeatures/outputBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 6
    [junit]    trace steps         : 4
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/outputBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify  examples/languageFeatures/staticVar.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 5
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 4
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OTHER, certainty: PROVEABLE) 
    [junit] at functionBad.cvl:18.2-13 "int a = f()":
    [junit] functionBad.cvl:18.2-13 "int a = f()" :  Attempt to use the return value of function f when f has returned without a return value.
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at functionBad.cvl:18.10-11 "f"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/functionBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/functionBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.14
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 2
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/functionBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at mallocBad.cvl:11.11-15 "p[4]":
    [junit] Attempt to dereference a pointer that refers to a memory space that is already deallocated
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at mallocBad.cvl:11.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/mallocBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/mallocBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 3
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 2
    [junit]    valid calls         : 7
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/mallocBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/arrayPointer.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 7
    [junit]    states saved        : 5
    [junit]    state matches       : 0
    [junit]    transitions         : 6
    [junit]    trace steps         : 4
    [junit]    valid calls         : 6
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/atomicStatement.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 23
    [junit]    states saved        : 7
    [junit]    state matches       : 1
    [junit]    transitions         : 23
    [junit]    trace steps         : 6
    [junit]    valid calls         : 16
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/stringTest.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 22
    [junit]    states saved        : 23
    [junit]    state matches       : 0
    [junit]    transitions         : 21
    [junit]    trace steps         : 18
    [junit]    valid calls         : 46
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/emptyWhen.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 2
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 1
    [junit]    trace steps         : 1
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/assertNonNullPointer.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 2
    [junit]    valid calls         : 5
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/arrays.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 12
    [junit]    states saved        : 9
    [junit]    state matches       : 0
    [junit]    transitions         : 11
    [junit]    trace steps         : 8
    [junit]    valid calls         : 33
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/assume.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 5
    [junit]    states saved        : 5
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 3
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 5:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at int2charBad.cvl:15.2-27 "$assert((pc[0] == ... )":
    [junit] 
    [junit] Input variables:
    [junit] num1=X0
    [junit] num2=X1
    [junit] 
    [junit] Context: 0<=SIZEOF_CHAR+-1 && 0<=-1*X0+254 && 0<=X0+-1 && 0<=-1*X1+254 && 0<=X1+-1
    [junit] 
    [junit] Assertion: $assert((*((pc+0))==*((pc+1))))
    [junit] -> *(&<d0>heap.malloc0[0][0]+0)==*(&<d0>heap.malloc0[0][0]+1)
    [junit] -> int2char(X0)==int2char(X1)
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at int2charBad.cvl:15.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/int2charBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/int2charBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.12
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 8
    [junit]    states saved        : 7
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 4
    [junit]    valid calls         : 45
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 7
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/int2charBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/choose.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1035468800
    [junit]    max process count   : 1
    [junit]    states              : 5
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 2
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/languageFeatures/arrayLiteral.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 14
    [junit]    states saved        : 8
    [junit]    state matches       : 0
    [junit]    transitions         : 13
    [junit]    trace steps         : 7
    [junit]    valid calls         : 4
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 11:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at procBound.cvl:4.2-17 "$assert($false)":
    [junit] 
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert(false)
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at procBound.cvl:8.15-21 "$spawn"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] process p2 (id=2):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] process p3 (id=3):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] process p4 (id=4):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] process p5 (id=5):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] process p6 (id=6):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] process p7 (id=7):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] process p8 (id=8):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] process p9 (id=9):
    [junit]   f at procBound.cvl:4.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/procBound_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -procBound=10 -showTransitions=false -showSavedStates=false examples/languageFeatures/procBound.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 10
    [junit]    states              : 20
    [junit]    states saved        : 11
    [junit]    state matches       : 0
    [junit]    transitions         : 20
    [junit]    trace steps         : 10
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/procBound_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/malloc.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 7
    [junit]    states saved        : 7
    [junit]    state matches       : 0
    [junit]    transitions         : 6
    [junit]    trace steps         : 5
    [junit]    valid calls         : 23
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at assertNullPointer.cvl:10.2-14 "$assert((p))":
    [junit] 
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((p!=(($real)*) 0))
    [junit] -> NULL!=(($real)*)0
    [junit] -> NULL!=NULL
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at assertNullPointer.cvl:10.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/assertNullPointer_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/assertNullPointer.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 2
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 2
    [junit]    trace steps         : 1
    [junit]    valid calls         : 8
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/assertNullPointer_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 9:
    [junit] CIVL execution violation in p2 (id = 1) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at removedHeapPointer.cvl:23.2-5 "*gp":
    [junit] Attempt to dereference a pointer that refers to a memory space that is already deallocated
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at removedHeapPointer.cvl:31.2-7 "$wait"
    [junit] 
    [junit] process p2 (id=1):
    [junit]   goo at removedHeapPointer.cvl:23.2-5 "*gp"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/removedHeapPointer_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/removedHeapPointer.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 3
    [junit]    states              : 13
    [junit]    states saved        : 10
    [junit]    state matches       : 0
    [junit]    transitions         : 13
    [junit]    trace steps         : 8
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/removedHeapPointer_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] I'm not null.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/procNull.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 3
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 5:
    [junit] CIVL execution violation in p0 (id = 0) (kind: POINTER, certainty: PROVEABLE) 
    [junit] at pointerSubtractionBad2.cvl:13.9-20 "x[1] - x[ ... ]":
    [junit] Operands of pointer subtraction point to different heap obejcts
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointerSubtractionBad2.cvl:13.2-6 "diff"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerSubtractionBad2_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerSubtractionBad2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 13
    [junit]    states saved        : 9
    [junit]    state matches       : 0
    [junit]    transitions         : 13
    [junit]    trace steps         : 4
    [junit]    valid calls         : 23
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 2
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerSubtractionBad2_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify  examples/languageFeatures/int2float.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 9
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 2
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/sizeof.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 9
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 1
    [junit]    valid calls         : 7
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/struct.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 10
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 9
    [junit]    trace steps         : 2
    [junit]    valid calls         : 10
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/conditionalExpression.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 98
    [junit]    states saved        : 26
    [junit]    state matches       : 0
    [junit]    transitions         : 97
    [junit]    trace steps         : 25
    [junit]    valid calls         : 35
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 63:
    [junit] CIVL execution violation in p0(id=0) (kind: OUT_OF_BOUNDS, certainty: PROVEABLE) 
    [junit] at bundleTestBad.cvl:20.2-36 "$bundle_unpack(bun, &a4d[1 ... )":
    [junit] Pointer addition results in an index out of bound error on A allocated sequence of memory space: (int[2][2][2][2])X_s1v3p0
    [junit] Original pointer: &<d1>a4d[1][0][1][0]
    [junit] Pointer addtion offset: 8
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at bundleTestBad.cvl:20.2-16 "$bundle_unpack"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/bundleTestBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/bundleTestBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 367
    [junit]    states saved        : 64
    [junit]    state matches       : 0
    [junit]    transitions         : 367
    [junit]    trace steps         : 62
    [junit]    valid calls         : 58
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/bundleTestBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/nonbooleanCondition.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 15
    [junit]    states saved        : 6
    [junit]    state matches       : 0
    [junit]    transitions         : 14
    [junit]    trace steps         : 5
    [junit]    valid calls         : 9
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] hello!2 is smaller than 10!
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at assertPrintf.cvl:13.2-48 "$assert(b > a,  ... )":
    [junit] 
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((a<b), &((_anon_1)[0]), b, a)
    [junit] -> 10<2
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at assertPrintf.cvl:13.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/assertPrintf_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/assertPrintf.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 6
    [junit]    trace steps         : 2
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/assertPrintf_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] x=colorOf(X_s1v1p0[2])
    [junit] x=colorOf(X_s1v1p0[1])
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/abstractFun.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 13
    [junit]    states saved        : 6
    [junit]    state matches       : 0
    [junit]    transitions         : 12
    [junit]    trace steps         : 4
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/for.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 79
    [junit]    states saved        : 44
    [junit]    state matches       : 0
    [junit]    transitions         : 78
    [junit]    trace steps         : 43
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/quantifiers.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 26
    [junit]    states saved        : 7
    [junit]    state matches       : 0
    [junit]    transitions         : 25
    [junit]    trace steps         : 6
    [junit]    valid calls         : 30
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 13
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at pointerAddBad.cvl:7.10-11 "p":
    [junit] Illegal pointer dereference: Array index out of bounds in method arrayRead.
    [junit] array: X0[9][9]
    [junit] extent: 10
    [junit] index: 10
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointerAddBad.cvl:7.2-6 "test"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerAddBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAddBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 3
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 2
    [junit]    valid calls         : 11
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerAddBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] i=0
    [junit] i=1
    [junit] i=2
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/sideEffectLoop.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 29
    [junit]    states saved        : 14
    [junit]    state matches       : 0
    [junit]    transitions         : 28
    [junit]    trace steps         : 13
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 112:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at pointerAddBad2.cvl:16.9-24 "(&p[0][0] ... )":
    [junit] Illegal pointer dereference: Array index out of bounds in method arrayRead.
    [junit] array: (int[10])<0,0,0,0,0,0,0,0,0,0>
    [junit] extent: 10
    [junit] index: 10
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointerAddBad2.cvl:16.2-5 "ret"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerAddBad2_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAddBad2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.1
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 354
    [junit]    states saved        : 123
    [junit]    state matches       : 0
    [junit]    transitions         : 354
    [junit]    trace steps         : 111
    [junit]    valid calls         : 806
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 2
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerAddBad2_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 14:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OUT_OF_BOUNDS, certainty: PROVEABLE) 
    [junit] at pointerAddBad3.c:5.11-12 "a":
    [junit] Pointer addition results in an index out of bound error on A allocated sequence of memory space: (int[3])X_s2v1p0
    [junit] Original pointer: &<d4>a[0]
    [junit] Pointer addtion offset: 100
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _main at pointerAddBad3.c:5.2-18 "int *p = a  ... 100" called from
    [junit]   _CIVL_system at GeneralTransformer:0.-1-20 "CIVL_argc, &_argv[..." inserted by GeneralTransformer.new main function before pointerAddBad3.c:3.13-17 "argc"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerAddBad3_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAddBad3.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.09
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 39
    [junit]    states saved        : 15
    [junit]    state matches       : 0
    [junit]    transitions         : 39
    [junit]    trace steps         : 13
    [junit]    valid calls         : 11
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerAddBad3_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 15:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at pointerAddBad4.c:8.7-16 "((int*)p)":
    [junit] Illegal pointer dereference: Cannot dereference an offset reference with non-zero offset:
    [junit] OffsetRef(Ref<1>,1)
    [junit] (int[2][2][2])<(int[2][2])<(int[2])<0,1>,(int[2])<2,3>>,(int[2][2])<(int[2])<4,5>,(int[2])<6,7>>>
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _main at pointerAddBad4.c:8.2-3 "t" called from
    [junit]   _CIVL_system at GeneralTransformer:0.-1-20 "CIVL_argc, &_argv[..." inserted by GeneralTransformer.new main function before pointerAddBad4.c:3.13-17 "argc"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerAddBad4_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAddBad4.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 40
    [junit]    states saved        : 16
    [junit]    state matches       : 0
    [junit]    transitions         : 40
    [junit]    trace steps         : 14
    [junit]    valid calls         : 8
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerAddBad4_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Error: This feature is not yet implemented: Pointer addition for anything other than array elements or variables
    [junit] at pointerAddBad5.c:6.15-27 "&point.x + 1".
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 16:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OUT_OF_BOUNDS, certainty: PROVEABLE) 
    [junit] at pointerAddBad6.c:8.13-23 "p + offset":
    [junit] Pointer addition resulted in out of bounds.
    [junit] object pointer:pointer<scope<2>,1,OffsetRef(Ref<1>,1)>
    [junit] offset = X2
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _main at pointerAddBad6.c:8.2-23 "void * q = p ... offset" called from
    [junit]   _CIVL_system at GeneralTransformer:0.-1-20 "CIVL_argc, &_argv[..." inserted by GeneralTransformer.new main function before pointerAddBad6.c:5.13-17 "argc"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerAddBad6_0.trace
    [junit] 
    [junit] === Command ===
    [junit] civl verify -errorBound=2 examples/languageFeatures/pointerAddBad6.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.16
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 45
    [junit]    states saved        : 19
    [junit]    state matches       : 0
    [junit]    transitions         : 44
    [junit]    trace steps         : 16
    [junit]    valid calls         : 19
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 8
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerAddBad6_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 13:
    [junit] CIVL execution violation in p0 (id = 0) (kind: POINTER, certainty: PROVEABLE) 
    [junit] at pointerAddBad7.c:4.13-14 "a":
    [junit] Pointer addition on an element reference on an incomplete array
    [junit] State -1:395207
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+9) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | CIVL_argc = X0
    [junit] | | | | CIVL_argv = (CHAR[10][])X1
    [junit] | | | | a = (int[])X2
    [junit] | | dyscope d1 (id=1, parent=d0, static=3)
    [junit] | | | variables
    [junit] | | | | _argv = (pointer[10]){&<d0>CIVL_argv[0][0], &<d0>CIVL_argv[1][0], &<d0>CIVL_argv[2][0], &<d0>CIVL_argv[3][0], &<d0>CIVL_argv[4][0], &<d0>CIVL_argv[5][0], &<d0>CIVL_argv[6][0], &<d0>CIVL_argv[7][0], &<d0>CIVL_argv[8][0], &<d0>CIVL_argv[9][0]}
    [junit] | | dyscope d4 (id=2, parent=d3, static=5)
    [junit] | | | variables
    [junit] | | | | p = NULL
    [junit] | | dyscope d3 (id=3, parent=d0, static=2)
    [junit] | | | variables
    [junit] | | | | argc = X0
    [junit] | | | | argv = &<d1>_argv[0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_main, location=11, pointerAddBad7.c:4.2-19 "void *p = (a ... )", dyscope=d4]
    [junit] | | | | Frame[function=_CIVL_system, location=9, GeneralTransformer:0.-1-20 "CIVL_argc, &_argv[..." inserted by GeneralTransformer.new main function before pointerAddBad7.c:3.13-17 "argc", dyscope=d1]
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerAddBad7_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAddBad7.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 39
    [junit]    states saved        : 14
    [junit]    state matches       : 0
    [junit]    transitions         : 39
    [junit]    trace steps         : 12
    [junit]    valid calls         : 7
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerAddBad7_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/bundleArray.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1042284544
    [junit]    max process count   : 1
    [junit]    states              : 10
    [junit]    states saved        : 7
    [junit]    state matches       : 0
    [junit]    transitions         : 9
    [junit]    trace steps         : 5
    [junit]    valid calls         : 37
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/sideEffects.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 17
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 16
    [junit]    trace steps         : 1
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/bitwise.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 9
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 1
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/not.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 1
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/cast.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 11
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 10
    [junit]    trace steps         : 1
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/self.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 2
    [junit]    states              : 9
    [junit]    states saved        : 6
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 5
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] b is true
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/intToBool.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 3
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at include3.cvl:4.2-15 "$assert(n>=0)" included from include2.cvl:1.9-23 ""include3.cvl"" included from include1.cvl:2.9-23 ""include2.cvl"":
    [junit] 
    [junit] Input variables:
    [junit] n=X0
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((0<=n))
    [junit] -> 0<=X0
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   f2 at include3.cvl:4.2-9 "$assert" included from include2.cvl:1.9-23 ""include3.cvl"" included from include1.cvl:2.9-23 ""include2.cvl"" called from
    [junit]   _CIVL_system at include1.cvl:7.2-4 "f2"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/include1_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -userIncludePath=examples/languageFeatures examples/languageFeatures/include1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.09
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 3
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 1
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/include1_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputn=5 examples/languageFeatures/comma.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 32
    [junit]    states saved        : 9
    [junit]    state matches       : 0
    [junit]    transitions         : 31
    [junit]    trace steps         : 8
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/duffs.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 76
    [junit]    states saved        : 53
    [junit]    state matches       : 0
    [junit]    transitions         : 75
    [junit]    trace steps         : 52
    [junit]    valid calls         : 167
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/enum1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 8
    [junit]    states saved        : 7
    [junit]    state matches       : 0
    [junit]    transitions         : 7
    [junit]    trace steps         : 6
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/enum2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 17
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 16
    [junit]    trace steps         : 1
    [junit]    valid calls         : 7
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0 (id = 0) (kind: POINTER, certainty: PROVEABLE) 
    [junit] at pointerSubtractionBad.cvl:11.9-14 "p - b":
    [junit] Operands of pointer subtraction point to the same obejct
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointerSubtractionBad.cvl:11.2-6 "diff"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerSubtractionBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerSubtractionBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 2
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerSubtractionBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/union.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 1
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputN=3 examples/languageFeatures/atomicWait.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 4
    [junit]    states              : 61
    [junit]    states saved        : 18
    [junit]    state matches       : 5
    [junit]    transitions         : 65
    [junit]    trace steps         : 22
    [junit]    valid calls         : 55
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/languageFeatures/civlParfor.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.11
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 9
    [junit]    states              : 1305
    [junit]    states saved        : 275
    [junit]    state matches       : 769
    [junit]    transitions         : 2073
    [junit]    trace steps         : 1043
    [junit]    valid calls         : 10214
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputNB=5 examples/languageFeatures/civlPragma.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 42
    [junit]    states saved        : 15
    [junit]    state matches       : 0
    [junit]    transitions         : 41
    [junit]    trace steps         : 7
    [junit]    valid calls         : 67
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 14
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: PROCESS_LEAK, certainty: CONCRETE) 
    [junit] at processLeak.cvl:20.0-1 "}":
    [junit] Attempt to terminate the main process while process 1(process<1>) is still running
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at processLeak.cvl:20.0-1 "}"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   process at processLeak.cvl:13.28-29 ";"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/processLeak_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/processLeak.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 2
    [junit]    states              : 3
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 1
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/processLeak_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 1:
    [junit] CIVL execution violation in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE) 
    [junit] at mallocBad2.cvl:10.2-3 "p":
    [junit] Attempt to read uninitialized variable p
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at mallocBad2.cvl:10.2-6 "p[4]"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/mallocBad2_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/mallocBad2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 0
    [junit]    states              : 1
    [junit]    states saved        : 1
    [junit]    state matches       : 0
    [junit]    transitions         : 1
    [junit]    trace steps         : 0
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/mallocBad2_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 1:
    [junit] CIVL execution violation in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE) 
    [junit] at undefPointer.cvl:11.6-12 "n.next":
    [junit] Attempt to use undefined pointer
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at undefPointer.cvl:11.2-4 "if"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/undefPointer_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/undefPointer.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 0
    [junit]    states              : 1
    [junit]    states saved        : 1
    [junit]    state matches       : 0
    [junit]    transitions         : 1
    [junit]    trace steps         : 0
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/undefPointer_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointers.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 46
    [junit]    states saved        : 34
    [junit]    state matches       : 0
    [junit]    transitions         : 45
    [junit]    trace steps         : 30
    [junit]    valid calls         : 27
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 4:
    [junit] CIVL execution violation in p0 (id = 0) (kind: INPUT_WRITE, certainty: PROVEABLE) 
    [junit] at inputBad.cvl:15.2-5 "*ka":
    [junit] Attempt to write to input variable k
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at inputBad.cvl:15.2-5 "*ka"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/inputBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/inputBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 5
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 3
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/inputBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/dynamicStruct.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 4
    [junit]    states              : 65
    [junit]    states saved        : 26
    [junit]    state matches       : 0
    [junit]    transitions         : 64
    [junit]    trace steps         : 25
    [junit]    valid calls         : 12
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Error: This feature is not yet implemented: Converting integer whose value is larger than UCHAR_MAX or is less than UCHAR_MIN to char type
    [junit] 
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/int2char.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 17
    [junit]    states saved        : 15
    [junit]    state matches       : 0
    [junit]    transitions         : 16
    [junit]    trace steps         : 12
    [junit]    valid calls         : 69
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 4
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 1:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OTHER, certainty: CONCRETE) 
    [junit] at atomChooseBad.cvl:13.4-11 "$choose":
    [junit] Non-determinism is encountered in $atom block.
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at atomChooseBad.cvl:13.4-11 "$choose"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/atomChooseBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/atomChooseBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 0
    [junit]    states              : 3
    [junit]    states saved        : 1
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 0
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/atomChooseBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/bundleStruct.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 10
    [junit]    states saved        : 9
    [junit]    state matches       : 0
    [junit]    transitions         : 9
    [junit]    trace steps         : 7
    [junit]    valid calls         : 6
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/atomicBlockedResume.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 3
    [junit]    states              : 40
    [junit]    states saved        : 20
    [junit]    state matches       : 2
    [junit]    transitions         : 41
    [junit]    trace steps         : 21
    [junit]    valid calls         : 94
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/assignIntWtReal.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 1
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAdd1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1053818880
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 2
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OUT_OF_BOUNDS, certainty: PROVEABLE) 
    [junit] at pointerAdd1.cvl:12.9-13 "&x+2":
    [junit] Pointer addition resulted in out of bounds.
    [junit] object pointer:pointer<scope<1>,1,Ref<1>>
    [junit] offset = 2
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointerAdd1.cvl:12.2-13 "int *p=&x+2"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerAdd1_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -DWRONG examples/languageFeatures/pointerAdd1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 2
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 2
    [junit]    trace steps         : 1
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerAdd1_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -DARRAY examples/languageFeatures/pointerAdd1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.01
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 2
    [junit]    valid calls         : 4
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OUT_OF_BOUNDS, certainty: PROVEABLE) 
    [junit] at pointerAdd1.cvl:5.9-10 "a":
    [junit] Pointer addition results in an index out of bound error on A allocated sequence of memory space: (int[10])X_s1v1p0
    [junit] Original pointer: &<d1>a[0]
    [junit] Pointer addtion offset: 11
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointerAdd1.cvl:5.2-13 "int *p=a+11"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointerAdd1_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -DARRAY -DWRONG examples/languageFeatures/pointerAdd1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 2
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 2
    [junit]    trace steps         : 1
    [junit]    valid calls         : 6
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointerAdd1_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAdd2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 1.44
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 1007
    [junit]    states saved        : 540
    [junit]    state matches       : 0
    [junit]    transitions         : 1006
    [junit]    trace steps         : 388
    [junit]    valid calls         : 4052
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 353
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAdd6.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 43
    [junit]    states saved        : 17
    [junit]    state matches       : 0
    [junit]    transitions         : 42
    [junit]    trace steps         : 15
    [junit]    valid calls         : 8
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 5:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OUTPUT_READ, certainty: PROVEABLE) 
    [junit] at pointersBad.cvl:18.10-16 "(&out)":
    [junit] Attempt to read output variable out
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointersBad.cvl:17.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/pointersBad_0.trace
    [junit] 
    [junit] Violation 1 encountered at depth 5:
    [junit] CIVL execution violation in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE) 
    [junit] at pointersBad.cvl:19.10-15 "x_ptr":
    [junit] Attempt to deference a pointer that is never initialized
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointersBad.cvl:17.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 1, writing trace to CIVLREP/pointersBad_1.trace
    [junit] 
    [junit] Violation 2 encountered at depth 6:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at pointersBad.cvl:20.22-23 "c":
    [junit] Illegal pointer dereference: Cannot dereference an offset reference with non-zero offset:
    [junit] OffsetRef(Ref<1>,1)
    [junit] NULL
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointersBad.cvl:20.17-18 "a"
    [junit] 
    [junit] Logging new entry 2, writing trace to CIVLREP/pointersBad_2.trace
    [junit] 
    [junit] Violation 3 encountered at depth 5:
    [junit] CIVL execution violation in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE) 
    [junit] at pointersBad.cvl:21.10-11 "c":
    [junit] Attempt to deference an invalid pointer
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointersBad.cvl:17.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 3, writing trace to CIVLREP/pointersBad_3.trace
    [junit] 
    [junit] Violation 4 encountered at depth 5:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at pointersBad.cvl:22.10-11 "b":
    [junit] Attempt to dereference pointer into scope which has been removed from state: 
    [junit] pointer expression: b
    [junit] evaluation: UNDEFINED
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointersBad.cvl:17.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 4, writing trace to CIVLREP/pointersBad_4.trace
    [junit] 
    [junit] Violation 5 encountered at depth 5:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at pointersBad.cvl:23.10-16 "nilPtr":
    [junit] Attempt to deference a null pointer
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at pointersBad.cvl:17.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 5, writing trace to CIVLREP/pointersBad_5.trace
    [junit] 
    [junit] === Command ===
    [junit] civl verify -errorBound=10 examples/languageFeatures/pointersBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 9
    [junit]    states saved        : 7
    [junit]    state matches       : 0
    [junit]    transitions         : 14
    [junit]    trace steps         : 11
    [junit]    valid calls         : 9
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/pointersBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/languageFeatures/civlfor.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 234
    [junit]    states saved        : 93
    [junit]    state matches       : 0
    [junit]    transitions         : 233
    [junit]    trace steps         : 92
    [junit]    valid calls         : 12
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/structStruct.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 9
    [junit]    states saved        : 5
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 4
    [junit]    valid calls         : 18
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/break.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 100
    [junit]    states saved        : 39
    [junit]    state matches       : 0
    [junit]    transitions         : 99
    [junit]    trace steps         : 38
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/compare.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 1
    [junit]    valid calls         : 4
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/minimal.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 2
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 1
    [junit]    trace steps         : 1
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Function prototype test: f(y) = 2 * y, then f(4) = 8.
    [junit] Function prototype test: g() = 10.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/functionPrototype.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 11
    [junit]    states saved        : 6
    [junit]    state matches       : 0
    [junit]    transitions         : 10
    [junit]    trace steps         : 5
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: UNDEFINED_VALUE, certainty: PROVEABLE) 
    [junit] at undefHeapPointer.cvl:12.6-13 "n->next":
    [junit] Attempt to use undefined pointer
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at undefHeapPointer.cvl:12.2-4 "if"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/undefHeapPointer_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/undefHeapPointer.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 2
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 2
    [junit]    trace steps         : 1
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/undefHeapPointer_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 1:
    [junit] CIVL execution violation in p0 (id = 0) (kind: OTHER, certainty: CONCRETE) 
    [junit] at atomWaitBad.cvl:19.4-9 "$wait":
    [junit] Blocked location is encountered in $atom block.
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at atomWaitBad.cvl:19.4-9 "$wait"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/atomWaitBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/atomWaitBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 0
    [junit]    states              : 1
    [junit]    states saved        : 1
    [junit]    state matches       : 0
    [junit]    transitions         : 1
    [junit]    trace steps         : 0
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/atomWaitBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/null.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1051197440
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 3
    [junit]    trace steps         : 2
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerAdd.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.66
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 4058
    [junit]    states saved        : 1493
    [junit]    state matches       : 0
    [junit]    transitions         : 4057
    [junit]    trace steps         : 1369
    [junit]    valid calls         : 16653
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 2
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/pointerSubtraction.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 37
    [junit]    states saved        : 23
    [junit]    state matches       : 0
    [junit]    transitions         : 36
    [junit]    trace steps         : 18
    [junit]    valid calls         : 130
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 2
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/linkedList.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.12
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 138
    [junit]    states saved        : 133
    [junit]    state matches       : 0
    [junit]    transitions         : 137
    [junit]    trace steps         : 118
    [junit]    valid calls         : 234
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 20
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/bundleSize.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 8
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 7
    [junit]    trace steps         : 2
    [junit]    valid calls         : 13
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/bundleTest.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.09
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 559
    [junit]    states saved        : 135
    [junit]    state matches       : 0
    [junit]    transitions         : 558
    [junit]    trace steps         : 126
    [junit]    valid calls         : 1307
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 2
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/structArray.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 19
    [junit]    states saved        : 9
    [junit]    state matches       : 0
    [junit]    transitions         : 18
    [junit]    trace steps         : 8
    [junit]    valid calls         : 18
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] The char value is 'b'
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/char.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 2
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/2dpointerTest.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 3
    [junit]    states              : 51
    [junit]    states saved        : 32
    [junit]    state matches       : 0
    [junit]    transitions         : 50
    [junit]    trace steps         : 23
    [junit]    valid calls         : 116
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/languageFeatures/functionPointer.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 4
    [junit]    states              : 411
    [junit]    states saved        : 227
    [junit]    state matches       : 53
    [junit]    transitions         : 463
    [junit]    trace steps         : 279
    [junit]    valid calls         : 815
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/bundleConcrete.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 18
    [junit]    states saved        : 8
    [junit]    state matches       : 0
    [junit]    transitions         : 17
    [junit]    trace steps         : 6
    [junit]    valid calls         : 54
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/languageFeatures/scopeOperators.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.09
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 40
    [junit]    states saved        : 22
    [junit]    state matches       : 0
    [junit]    transitions         : 39
    [junit]    trace steps         : 21
    [junit]    valid calls         : 41
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/atomStatement.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 6
    [junit]    states              : 806
    [junit]    states saved        : 129
    [junit]    state matches       : 80
    [junit]    transitions         : 885
    [junit]    trace steps         : 208
    [junit]    valid calls         : 283
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: MEMORY_LEAK, certainty: CONCRETE) 
    [junit] at scoping.cvl:11.2-14.3 "{\n     p = (int ... }":
    [junit] The dyscope d2(id=1) has a non-empty heap upon termination.
    [junit] heap
    [junit] | objects of malloc 0 at scoping.cvl:12.5-44 "p = (int *) ... )":
    [junit] | | 0: (int[1])Hop0s1f0o0
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at scoping.cvl:21.5-6 "q"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/scoping_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/scoping.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 1
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/scoping_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/implies.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 37
    [junit]    states saved        : 14
    [junit]    state matches       : 0
    [junit]    transitions         : 36
    [junit]    trace steps         : 12
    [junit]    valid calls         : 18
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 5
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 20:
    [junit] CIVL execution violation in p1 (id = 1) (kind: MEMORY_LEAK, certainty: CONCRETE) 
    [junit] at memoryLeak.cvl:10.14-21.1 "{\n  int * p  ... }":
    [junit] The dyscope d3(id=4) has a non-empty heap upon termination.
    [junit] heap
    [junit] | objects of malloc 1 at memoryLeak.cvl:11.2-47 "int * p = ( ... )":
    [junit] | | 0: (int[1]){10}
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at memoryLeak.cvl:28.2-7 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   terminated
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/memoryLeak_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/memoryLeak.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.12
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 2
    [junit]    states              : 33
    [junit]    states saved        : 27
    [junit]    state matches       : 0
    [junit]    transitions         : 33
    [junit]    trace steps         : 19
    [junit]    valid calls         : 14
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 2
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/memoryLeak_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] x=0
    [junit] x=1
    [junit] x=2
    [junit] x=3
    [junit] x=4
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/choose_int.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 995622912
    [junit]    max process count   : 1
    [junit]    states              : 22
    [junit]    states saved        : 7
    [junit]    state matches       : 4
    [junit]    transitions         : 25
    [junit]    trace steps         : 10
    [junit]    valid calls         : 5
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p1(id=1) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at spawnFoo.cvl:4.2-19 "$assert(($false))":
    [junit] 
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert(false)
    [junit] -> false
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at spawnFoo.cvl:10.2-7 "$wait"
    [junit] 
    [junit] process p1 (id=1):
    [junit]   foo at spawnFoo.cvl:4.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/spawnFoo_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/spawnFoo.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 2
    [junit]    states              : 2
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 2
    [junit]    trace steps         : 1
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/spawnFoo_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/switch.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 18
    [junit]    states saved        : 21
    [junit]    state matches       : 0
    [junit]    transitions         : 17
    [junit]    trace steps         : 14
    [junit]    valid calls         : 53
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 18
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 1:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DIVISION_BY_ZERO, certainty: PROVEABLE) 
    [junit] at badGuard.cvl:14.10-13 "x/y":
    [junit] Division by zero
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at badGuard.cvl:13.2-9 "$choose"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/badGuard_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/badGuard.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 0
    [junit]    states              : 2
    [junit]    states saved        : 1
    [junit]    state matches       : 0
    [junit]    transitions         : 2
    [junit]    trace steps         : 0
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/badGuard_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 2:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DIVISION_BY_ZERO, certainty: PROVEABLE) 
    [junit] at noopBad.cvl:10.2-8 "a[0]/n":
    [junit] Division by zero
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at noopBad.cvl:10.2-3 "a"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/noopBad_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify  examples/languageFeatures/noopBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 3
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 1
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/noopBad_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/languageFeatures/continue.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 776
    [junit]    states saved        : 207
    [junit]    state matches       : 0
    [junit]    transitions         : 775
    [junit]    trace steps         : 206
    [junit]    valid calls         : 97
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] ------------- ---------------- ---------------
    [junit] ------------- Standard Error -----------------
    [junit] Error: The parameters for the function have not been specified.
    [junit] Note that a prototype for a function with 0 parameters must have the form "f(void)"
    [junit] at functionPrototypeBad.cvl:8.6-9 "f()"
    [junit] Syntax error: $abstract functions must have at least one input.
    [junit] An abstract function with 0 inputs is a constant.
    [junit] It can be declared as an unconstrained input variable instead, e.g.
    [junit] $input int N;
    [junit] at abstractFunNoArg.cvl:4.0-26 "$abstract int random(void)".
    [junit] Syntax error: attempt to modify the input variable N
    [junit] at assignInput.cvl:9.2-3 "N".
    [junit] ------------- ---------------- ---------------
    [junit] Testcase: bigO(edu.udel.cis.vsl.civl.LanguageFeaturesTest):SKIPPED
    [junit] Testsuite: edu.udel.cis.vsl.civl.LibraryTest
    [junit] Tests run: 41, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 2.435 sec
    [junit] 
    [junit] ------------- Standard Output ---------------
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputN=10 -enablePrintf=false -showProgram=false examples/library/time/timeTest.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 11
    [junit]    states              : 137
    [junit]    states saved        : 63
    [junit]    state matches       : 0
    [junit]    transitions         : 136
    [junit]    trace steps         : 62
    [junit]    valid calls         : 2082
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputn=4 -enablePrintf=false examples/library/civlc/domainDecomposition.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 260
    [junit]    states saved        : 107
    [junit]    state matches       : 0
    [junit]    transitions         : 259
    [junit]    trace steps         : 106
    [junit]    valid calls         : 301
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] a=stringToInt("%d",contents((CHAR[11])<'C','I','V','L','_','s','t','d','i','n',''>)[0]), b=stringToInt("%d",contents((CHAR[11])<'C','I','V','L','_','s','t','d','i','n',''>)[1]), c=stringToInt("%d",contents((CHAR[11])<'C','I','V','L','_','s','t','d','i','n',''>)[2])
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/stdio/scanfExit.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 40
    [junit]    states saved        : 32
    [junit]    state matches       : 0
    [junit]    transitions         : 39
    [junit]    trace steps         : 29
    [junit]    valid calls         : 42
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 5
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/civlc/translate_ptr.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 19
    [junit]    states saved        : 17
    [junit]    state matches       : 0
    [junit]    transitions         : 18
    [junit]    trace steps         : 15
    [junit]    valid calls         : 9
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/./funcPointer.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 5
    [junit]    trace steps         : 3
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0 (id = 0) (kind: DEREFERENCE, certainty: PROVEABLE) 
    [junit] at freeBad1.cvl:8.2-4 "*a":
    [junit] Attempt to dereference a pointer that refers to a memory space that is already deallocated
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at freeBad1.cvl:8.2-4 "*a"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/freeBad1_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/civlc/freeBad1.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 2
    [junit]    valid calls         : 5
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/freeBad1_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0(id=0) (kind: MEMORY_LEAK, certainty: PROVEABLE) 
    [junit] at freeBad2.cvl:8.2-10 "$free(a)":
    [junit] Attempt to free a memory space that is already freed
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at freeBad2.cvl:8.2-7 "$free"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/freeBad2_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/civlc/freeBad2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 4
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 2
    [junit]    valid calls         : 4
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/freeBad2_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -inputNPROCS=2 -inputN_BOUND=2 -enablePrintf=false examples/library/civlc/communicatorFeatures.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.11
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 3
    [junit]    states              : 197
    [junit]    states saved        : 130
    [junit]    state matches       : 0
    [junit]    transitions         : 196
    [junit]    trace steps         : 118
    [junit]    valid calls         : 329
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 7
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] ===================The program after linking and applying transformer is:===================
    [junit] //======================== civlc.cvh =======================
    [junit] void $assume(_Bool expr);
    [junit] void $assume(_Bool expr);
    [junit] //======================= assume.cvl =======================
    [junit] _Bool alwaysTrue()
    [junit] {
    [junit]   return $true;
    [junit] }
    [junit] _Bool $sef$0 = alwaysTrue();
    [junit] $assume($sef$0);
    [junit] int main()
    [junit] {
    [junit]   return 0;
    [junit] }
    [junit] 
    [junit] 
    [junit] === Command ===
    [junit] civl verify -showProgram examples/library/civlc/assume.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 5
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 4
    [junit]    trace steps         : 2
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/civlc/exitBad.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 4
    [junit]    states              : 28
    [junit]    states saved        : 11
    [junit]    state matches       : 0
    [junit]    transitions         : 27
    [junit]    trace steps         : 10
    [junit]    valid calls         : 20
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/civlc/equals.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 11
    [junit]    states saved        : 9
    [junit]    state matches       : 0
    [junit]    transitions         : 10
    [junit]    trace steps         : 7
    [junit]    valid calls         : 12
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/library/time/localTime.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 13
    [junit]    states saved        : 8
    [junit]    state matches       : 0
    [junit]    transitions         : 12
    [junit]    trace steps         : 7
    [junit]    valid calls         : 5
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/string/memcpy.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 97
    [junit]    states saved        : 60
    [junit]    state matches       : 0
    [junit]    transitions         : 96
    [junit]    trace steps         : 54
    [junit]    valid calls         : 165
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 2
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] a[0] = '' a[1] = '' a[2] = '' a[3] = X_s1v1p0[3] a[4] = X_s1v1p0[4] 
    [junit] === Command ===
    [junit] civl verify examples/library/string/memset.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.08
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 27
    [junit]    states saved        : 8
    [junit]    state matches       : 0
    [junit]    transitions         : 26
    [junit]    trace steps         : 7
    [junit]    valid calls         : 29
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/library/pointer/simpleAssertEquals.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 1011351552
    [junit]    max process count   : 1
    [junit]    states              : 10
    [junit]    states saved        : 7
    [junit]    state matches       : 0
    [junit]    transitions         : 9
    [junit]    trace steps         : 6
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/library/pointer/simpleAssertEquals2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.11
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 19
    [junit]    states saved        : 15
    [junit]    state matches       : 0
    [junit]    transitions         : 18
    [junit]    trace steps         : 13
    [junit]    valid calls         : 29
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/library/stdio/printf.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.07
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 73
    [junit]    states saved        : 28
    [junit]    state matches       : 0
    [junit]    transitions         : 72
    [junit]    trace steps         : 26
    [junit]    valid calls         : 18
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 3
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] path condition: 0<X0
    [junit] path condition: 0<-1*X0 && 0<X0
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/civlc/pathcondition.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.04
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 7
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 6
    [junit]    trace steps         : 1
    [junit]    valid calls         : 1
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify -D_LINUX examples/library/stdlib/rand_r.c 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.03
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 8
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 7
    [junit]    trace steps         : 3
    [junit]    valid calls         : 0
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] Violation 0 encountered at depth 3:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at random.cvl:7.2-23 "$assert(val1 == val2)":
    [junit] 
    [junit] 
    [junit] Context: true
    [junit] 
    [junit] Assertion: $assert((val1==val2))
    [junit] -> rand_work(1)==rand_work(2)
    [junit] -> 0==-1*rand_work(1)+rand_work(2)
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at random.cvl:7.2-9 "$assert"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/random_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/stdlib/random.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 7
    [junit]    states saved        : 3
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 2
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/random_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/string/string_test.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.06
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 16
    [junit]    states saved        : 9
    [junit]    state matches       : 0
    [junit]    transitions         : 15
    [junit]    trace steps         : 7
    [junit]    valid calls         : 9
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/./assert_test.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 8
    [junit]    states saved        : 2
    [junit]    state matches       : 0
    [junit]    transitions         : 7
    [junit]    trace steps         : 1
    [junit]    valid calls         : 3
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 3 and 4 are not equal!
    [junit] 
    [junit] 
    [junit] Violation 0 encountered at depth 4:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at simpleAssertEqualsFail.cvl:9.2-60 "$assert_equals(a, b, "%d and %d are not equal!\n" ... )":
    [junit] Context: true
    [junit] Assertion voilated: $assert_equals(a, b, &((_anon_0)[0]), *(a), *(b))
    [junit] Evaluation: 
    [junit]           a=&<d1>val1
    [junit]           b=&<d1>val2
    [junit] Result: 
    [junit]           <d1>val1=3
    [junit]           <d1>val2=4
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at simpleAssertEqualsFail.cvl:9.2-16 "$assert_equals"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/simpleAssertEqualsFail_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/library/pointer/simpleAssertEqualsFail.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 6
    [junit]    states saved        : 4
    [junit]    state matches       : 0
    [junit]    transitions         : 6
    [junit]    trace steps         : 3
    [junit]    valid calls         : 2
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/simpleAssertEqualsFail_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] Pointer to an array and pointer to the first element of an array are different.
    [junit] 
    [junit] 
    [junit] Violation 0 encountered at depth 7:
    [junit] CIVL execution violation in p0(id=0) (kind: ASSERTION_VIOLATION, certainty: PROVEABLE) 
    [junit] at simpleAssertEqualsFail2.cvl:17.2-120 "$assert_equals(&array, &array[ ... )":
    [junit] Context: 0 <= SIZEOF(dynamicType<113>)+-1
    [junit] Assertion voilated: $assert_equals(&(array), &(*((array+0))), &((_anon_0)[0]))
    [junit] Evaluation: 
    [junit]           &(array)=&<d1>array
    [junit]           &(*((array+0)))=&<d0>heap.malloc0[0][0]
    [junit] Result: 
    [junit]           <d1>array=&<d0>heap.malloc0[0][0]
    [junit]           <d0>heap.malloc0[0][0]=(INT_DOUBLE){1, 23/10}
    [junit] 
    [junit] Call stacks:
    [junit] 
    [junit] process p0 (id=0):
    [junit]   _CIVL_system at simpleAssertEqualsFail2.cvl:17.2-16 "$assert_equals"
    [junit] 
    [junit] Logging new entry 0, writing trace to CIVLREP/simpleAssertEqualsFail2_0.trace
    [junit] Terminating search after finding 1 violation.
    [junit] 
    [junit] === Command ===
    [junit] civl verify -enablePrintf=false examples/library/pointer/simpleAssertEqualsFail2.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.05
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 8
    [junit]    states saved        : 8
    [junit]    state matches       : 0
    [junit]    transitions         : 8
    [junit]    trace steps         : 6
    [junit]    valid calls         : 15
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 1
    [junit] 
    [junit] === Result ===
    [junit] The program MAY NOT be correct.  See CIVLREP/simpleAssertEqualsFail2_log.txt
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] === Command ===
    [junit] civl verify examples/library/civlc/contains.cvl 
    [junit] 
    [junit] === Stats ===
    [junit]    time (s)            : 0.02
    [junit]    memory (bytes)      : 961019904
    [junit]    max process count   : 1
    [junit]    states              : 28
    [junit]    states saved        : 13
    [junit]    state matches       : 0
    [junit]    transitions         : 27
    [junit]    trace steps         : 12
    [junit]    valid calls         : 5
    [junit]    provers             : cvc4, z3, cvc3
    [junit]    prover calls        : 0
    [junit] 
    [junit] === Result ===
    [junit] The standard properties hold for all executions.
    [junit] CIVL v1.2 of 2015-07-13 -- http://vsl.cis.udel.edu/civl
    [junit] 
    [junit] State 1
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = NULL
    [junit] | | | | counter = NULL
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=2, barrier.cvl:10.0-7 "$assume", dyscope=d0]
    [junit] 
    [junit] State 3
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+4) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = NULL
    [junit] | | | | counter = NULL
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=3, barrier.cvl:11.21-37 "$gbarrier_create", dyscope=d0]
    [junit] 
    [junit] State 4
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+4) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=X0, 
    [junit] | | | | | | | | .proc_map=(lambda i : int . process<-2>), 
    [junit] | | | | | | | | .in_barrier=(lambda i : int . false), 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[X0])X_s1v1p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=7, barrier.cvl:33.17-22 "i < N", dyscope=d2]
    [junit] 
    [junit] State 5
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+4) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=X0, 
    [junit] | | | | | | | | .proc_map=(lambda i : int . process<-2>), 
    [junit] | | | | | | | | .in_barrier=(lambda i : int . false), 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[X0])X_s1v1p0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, barrier.cvl:34.15-21 "$spawn", dyscope=d2]
    [junit] 
    [junit] State 6
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+4) && (0 <= X0+-1)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=X0, 
    [junit] | | | | | | | | .proc_map=(lambda i : int . process<-2>), 
    [junit] | | | | | | | | .in_barrier=(lambda i : int . false), 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[X0])(X_s1v1p0){[0]=p1}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=7, barrier.cvl:33.17-22 "i < N", dyscope=d2]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] 
    [junit] State 8
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+4) && (0 <= X0+-2)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=X0, 
    [junit] | | | | | | | | .proc_map=(lambda i : int . process<-2>), 
    [junit] | | | | | | | | .in_barrier=(lambda i : int . false), 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 1
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[X0])(X_s1v1p0){[0]=p1}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, barrier.cvl:34.15-21 "$spawn", dyscope=d2]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] 
    [junit] State 9
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+4) && (0 <= X0+-2)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=X0, 
    [junit] | | | | | | | | .proc_map=(lambda i : int . process<-2>), 
    [junit] | | | | | | | | .in_barrier=(lambda i : int . false), 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[X0])(X_s1v1p0){[0]=p1, [1]=p2}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=7, barrier.cvl:33.17-22 "i < N", dyscope=d2]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] 
    [junit] State 11
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+4) && (0 <= X0+-3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=X0, 
    [junit] | | | | | | | | .proc_map=(lambda i : int . process<-2>), 
    [junit] | | | | | | | | .in_barrier=(lambda i : int . false), 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 2
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[X0])(X_s1v1p0){[0]=p1, [1]=p2}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, barrier.cvl:34.15-21 "$spawn", dyscope=d2]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] 
    [junit] State 12
    [junit] | Path condition
    [junit] | | (0 <= -1*X0+4) && (0 <= X0+-3)
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=X0, 
    [junit] | | | | | | | | .proc_map=(lambda i : int . process<-2>), 
    [junit] | | | | | | | | .in_barrier=(lambda i : int . false), 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = X0
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 3
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[X0])(X_s1v1p0){[0]=p1, [1]=p2, [2]=p3}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=7, barrier.cvl:33.17-22 "i < N", dyscope=d2]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] 
    [junit] State 14
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={$proc_null, $proc_null, $proc_null, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 3
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4])(X_s1v1p0){[0]=p1, [1]=p2, [2]=p3}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=8, barrier.cvl:34.15-21 "$spawn", dyscope=d2]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] 
    [junit] State 15
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={$proc_null, $proc_null, $proc_null, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d2 (id=1, parent=d1, static=13)
    [junit] | | | variables
    [junit] | | | | i = 4
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=7, barrier.cvl:33.17-22 "i < N", dyscope=d2]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 16
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={$proc_null, $proc_null, $proc_null, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=11, barrier.cvl:35.17-22 "i < N", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 17
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={$proc_null, $proc_null, $proc_null, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 18
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, $proc_null, $proc_null, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=20, barrier.cvl:17.8-13 "$true", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 19
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, $proc_null, $proc_null, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 20
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, $proc_null, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=20, barrier.cvl:17.8-13 "$true", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 21
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, $proc_null, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 22
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=20, barrier.cvl:17.8-13 "$true", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 23
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, $proc_null}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | barrier = NULL
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=19, barrier.cvl:15.21-36 "$barrier_create", dyscope=d10]
    [junit] 
    [junit] State 24
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=20, barrier.cvl:17.8-13 "$true", dyscope=d10]
    [junit] 
    [junit] State 25
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 26
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 27
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 28
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 29
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 30
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 31
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 32
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 33
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d14]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 34
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 35
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 36
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d15]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 37
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 38
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 39
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 40
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=22, barrier.cvl:19.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 41
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 42
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 43
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d16]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 44
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 45
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 46
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d17]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 47
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 48
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 49
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d18]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 50
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=23, barrier.cvl:20.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 51
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 52
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d19]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 53
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 54
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 55
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 56
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=24, barrier.cvl:21.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 57
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 58
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 59
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d20]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 60
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 61
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 62
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d21]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 63
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 64
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 65
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d22]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 66
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=25, barrier.cvl:22.4-11 "$assert", dyscope=d10]
    [junit] 
    [junit] State 67
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 68
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d23]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 69
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 70
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 71
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 72
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=26, barrier.cvl:23.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 73
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 4
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 74
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 75
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d24]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 76
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 77
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 78
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d25]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 79
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 80
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 81
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d26]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 82
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 83
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 84
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d27]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 85
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 86
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=20, barrier.cvl:17.8-13 "$true", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 87
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 88
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=20, barrier.cvl:17.8-13 "$true", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 89
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 90
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=20, barrier.cvl:17.8-13 "$true", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 91
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=21, barrier.cvl:18.4-11 "$assert", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 92
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 93
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d28]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 94
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 95
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 96
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, true, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d26]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 97
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 98
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d30]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 99
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 100
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 101
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d25]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 102
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 103
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d28]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 104
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 105
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 106
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d25]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 107
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 108
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d34]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 109
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 110
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 111
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d25]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 112
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 113
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={true, false, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d12]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d30]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 114
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 115
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d37]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 116
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 117
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 118
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d24]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 119
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 120
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d30]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 121
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 122
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 123
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d24]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 124
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 125
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d28]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 126
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 127
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 128
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=3}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 0
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=11, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=12, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=13, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=14, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d24]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 129
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 130
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d34]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 131
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 132
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 133
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=8, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=9, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d24]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 134
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 135
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, true, false, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d13]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d30]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 136
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 137
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d46]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 138
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 139
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 140
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d24]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 141
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 142
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d37]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d10]
    [junit] 
    [junit] State 143
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 144
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, false}, 
    [junit] | | | | | | | | .num_in_barrier=1}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d34]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 145
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 2
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 146
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 147
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d12 (id=5, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d6 (id=6, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=7, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d24]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 148
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=9, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=10, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=11, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=12, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 149
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, true, true}, 
    [junit] | | | | | | | | .num_in_barrier=2}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 1
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d13 (id=7, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d8 (id=8, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=9, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d14 (id=10, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d10 (id=11, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=12, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | | dyscope d15 (id=13, parent=d0, static=10)
    [junit] | | | variables
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=16, concurrency.cvl:59.2-16 "$barrier_enter", dyscope=d37]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d14]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=$barrier_call, location=17, concurrency.cvl:60.2-15 "$barrier_exit", dyscope=d15]
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 150
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscope d5 (id=6, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 1
    [junit] | | dyscope d8 (id=7, parent=d7, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=2, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d8>heap.malloc1[0][0]
    [junit] | | dyscope d7 (id=8, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 2
    [junit] | | dyscope d10 (id=9, parent=d9, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=3, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d10>heap.malloc1[0][0]
    [junit] | | dyscope d9 (id=10, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 3
    [junit] | Process states
    [junit] | | process p0(id=0)
    [junit] | | | call stack
    [junit] | | | | Frame[function=_CIVL_system, location=12, barrier.cvl:36.4-9 "$wait", dyscope=d11]
    [junit] | | process p1(id=1)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d4]
    [junit] | | process p2(id=2)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d6]
    [junit] | | process p3(id=3)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=27, barrier.cvl:24.4-11 "counter", dyscope=d8]
    [junit] | | process p4(id=4)
    [junit] | | | call stack
    [junit] | | | | Frame[function=process, location=28, barrier.cvl:25.4-17 "$barrier_call", dyscope=d10]
    [junit] 
    [junit] State 151
    [junit] | Path condition
    [junit] | | true
    [junit] | Dynamic scopes
    [junit] | | dyscope d0 (id=0, parent=NULL, static=0)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 0:
    [junit] | | | | | | 0: ($gbarrier[1]){
    [junit] | | | | | | | {
    [junit] | | | | | | | | .nprocs=4, 
    [junit] | | | | | | | | .proc_map={p1, p2, p3, p4}, 
    [junit] | | | | | | | | .in_barrier={false, false, false, false}, 
    [junit] | | | | | | | | .num_in_barrier=0}}
    [junit] | | | | N = 4
    [junit] | | | | B = 5
    [junit] | | | | gbarrier = &<d0>heap.malloc0[0][0]
    [junit] | | | | counter = 3
    [junit] | | dyscope d11 (id=1, parent=d1, static=14)
    [junit] | | | variables
    [junit] | | | | i = 0
    [junit] | | dyscope d1 (id=2, parent=d0, static=12)
    [junit] | | | variables
    [junit] | | | | procs = (process[4]){p1, p2, p3, p4}
    [junit] | | dyscope d4 (id=3, parent=d3, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=0, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d4>heap.malloc1[0][0]
    [junit] | | dyscope d3 (id=4, parent=d0, static=11)
    [junit] | | | variables
    [junit] | | | | id = 0
    [junit] | | dyscope d6 (id=5, parent=d5, static=15)
    [junit] | | | variables
    [junit] | | | | _heap = 
    [junit] | | | | | objects of malloc 1:
    [junit] | | | | | | 0: ($barrier[1]){
    [junit] | | | | | | | {.place=1, .gbarrier=&<d0>heap.malloc0[0][0]}}
    [junit] | | | | barrier = &<d6>heap.malloc1[0][0]
    [junit] | | dyscop