Path: . Working Copy Root Path: /Users/tester/work/civl/0.9/r771 URL: svn://vsl.cis.udel.edu/civl/tags/0.9 Relative URL: ^/tags/0.9 Repository Root: svn://vsl.cis.udel.edu/civl Repository UUID: fb995dde-84ed-4084-dfe6-e5aef3e2452c Revision: 771 Node Kind: directory Schedule: normal Last Changed Author: zmanchun Last Changed Rev: 771 Last Changed Date: 2014-03-14 23:27:14 -0400 (Fri, 14 Mar 2014)
Stdout:
Buildfile: /Users/tester/work/civl/0.9/r771/build.xml
compile:
[mkdir] Created dir: /Users/tester/work/civl/0.9/r771/bin
[javac] Compiling 238 source files to /Users/tester/work/civl/0.9/r771/bin
[javac] Creating empty /Users/tester/work/civl/0.9/r771/bin/edu/udel/cis/vsl/civl/gui/package-info.class
[javac] Creating empty /Users/tester/work/civl/0.9/r771/bin/edu/udel/cis/vsl/civl/library/pthread/package-info.class
[javac] Creating empty /Users/tester/work/civl/0.9/r771/bin/edu/udel/cis/vsl/civl/state/package-info.class
[javac] Creating empty /Users/tester/work/civl/0.9/r771/bin/edu/udel/cis/vsl/civl/library/IF/package-info.class
jar:
[jar] Building jar: /Users/tester/work/civl/0.9/r771/civl.jar
test-init:
[mkdir] Created dir: /Users/tester/work/civl/0.9/r771/junit
[mkdir] Created dir: /Users/tester/work/civl/0.9/r771/junit/data
[mkdir] Created dir: /Users/tester/work/civl/0.9/r771/junit/reports
[mkdir] Created dir: /Users/tester/work/civl/0.9/r771/bin-test
test-compile:
[javac] Compiling 8 source files to /Users/tester/work/civl/0.9/r771/bin-test
test-run:
[jacoco:coverage] Enhancing junit with coverage
[junit] objc[9790]: Class JavaLaunchHelper is implemented in both /Library/Java/JavaVirtualMachines/jdk1.7.0_45.jdk/Contents/Home/jre/bin/java and /Library/Java/JavaVirtualMachines/jdk1.7.0_45.jdk/Contents/Home/jre/lib/libinstrument.dylib. One of the two will be used. Which one is undefined.
[junit] Testsuite: edu.udel.cis.vsl.civl.AccuracyTest
[junit] Tests run: 10, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 15.062 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 64
[junit] proverCalls : 2
[junit] memory (bytes) : 257425408
[junit] time (s) : 3.42
[junit] maxProcs : 1
[junit] statesInstantiated : 102
[junit] statesSaved : 15
[junit] statesSeen : 14
[junit] statesMatched : 0
[junit] steps : 28
[junit] transitions : 13
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 127
[junit] proverCalls : 4
[junit] memory (bytes) : 328204288
[junit] time (s) : 4.64
[junit] maxProcs : 1
[junit] statesInstantiated : 99
[junit] statesSaved : 14
[junit] statesSeen : 13
[junit] statesMatched : 0
[junit] steps : 27
[junit] transitions : 12
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 194
[junit] proverCalls : 5
[junit] memory (bytes) : 620232704
[junit] time (s) : 7.15
[junit] maxProcs : 1
[junit] statesInstantiated : 113
[junit] statesSaved : 9
[junit] statesSeen : 8
[junit] statesMatched : 0
[junit] steps : 30
[junit] transitions : 7
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 372
[junit] proverCalls : 12
[junit] memory (bytes) : 620756992
[junit] time (s) : 9.24
[junit] maxProcs : 1
[junit] statesInstantiated : 298
[junit] statesSaved : 46
[junit] statesSeen : 44
[junit] statesMatched : 0
[junit] steps : 88
[junit] transitions : 43
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 550
[junit] proverCalls : 14
[junit] memory (bytes) : 875560960
[junit] time (s) : 9.88
[junit] maxProcs : 1
[junit] statesInstantiated : 298
[junit] statesSaved : 46
[junit] statesSeen : 44
[junit] statesMatched : 0
[junit] steps : 88
[junit] transitions : 43
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 12:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: MAYBE)
[junit] Cannot prove assertion holds: $assert(UNIFORM {int k=1..(n-2)} ((*((result+k))-$D[rho, {x,2}]((($real) k*h)))==$O(((((h*h)*h)*h)*h))))
[junit] Path condition: (0 == -1*rhox3(0)*(X_s0v2^3)+-6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-3*rho(-1*X_s0v2)+3*X_s0v4[1]) && (0 == -1*rhox3(3*X_s0v2)*(X_s0v2^3)+-6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+3*rho(4*X_s0v2)+-3*X_s0v4[2]) && (0 == -1*rhox3(2*X_s0v2)*(X_s0v2^3)+-6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-3*X_s0v4[1]+3*X_s0v4[3]) && (0 == -1*rhox3(X_s0v2)*(X_s0v2^3)+-6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+3*X_s0v4[2]+-3*X_s0v4[0]) && (0 <= -1*rhox3(3*X_s0v2)*(X_s0v2^3)+-3*rhox2(3*X_s0v2)*(X_s0v2^2)+-6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(3*X_s0v2)+6*rho(4*X_s0v2)) && (0 <= -1*rhox3(2*X_s0v2)*(X_s0v2^3)+-3*rhox2(2*X_s0v2)*(X_s0v2^2)+-6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(2*X_s0v2)+6*rho(3*X_s0v2)) && (0 <= -1*rhox3(X_s0v2)*(X_s0v2^3)+-3*rhox2(X_s0v2)*(X_s0v2^2)+-6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(X_s0v2)+6*rho(2*X_s0v2)) && (0 <= -1*rhox3(0)*(X_s0v2^3)+-3*rhox2(0)*(X_s0v2^2)+-6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(X_s0v2)+-6*rho(0)) && (0 == -1/6*rhox3(0)*(X_s0v2^3)+1/2*rhox2(0)*(X_s0v2^2)+-1*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-1*rho(-1*X_s0v2)+rho(0)) && (0 == -1/6*rhox3(X_s0v2)*(X_s0v2^3)+1/2*rhox2(X_s0v2)*(X_s0v2^2)+-1*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+rho(X_s0v2)+-1*rho(0)) && (0 == -1/6*rhox3(2*X_s0v2)*(X_s0v2^3)+1/2*rhox2(2*X_s0v2)*(X_s0v2^2)+-1*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-1*rho(X_s0v2)+rho(2*X_s0v2)) && (0 == -1/6*rhox3(3*X_s0v2)*(X_s0v2^3)+1/2*rhox2(3*X_s0v2)*(X_s0v2^2)+-1*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-1*rho(2*X_s0v2)+rho(3*X_s0v2)) && (0 <= rhox3(3*X_s0v2)*(X_s0v2^3)+3*rhox2(3*X_s0v2)*(X_s0v2^2)+6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(3*X_s0v2)+-6*rho(4*X_s0v2)) && (0 <= rhox3(2*X_s0v2)*(X_s0v2^3)+3*rhox2(2*X_s0v2)*(X_s0v2^2)+6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(2*X_s0v2)+-6*rho(3*X_s0v2)) && (0 <= rhox3(X_s0v2)*(X_s0v2^3)+3*rhox2(X_s0v2)*(X_s0v2^2)+6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(X_s0v2)+-6*rho(2*X_s0v2)) && (0 <= rhox3(0)*(X_s0v2^3)+3*rhox2(0)*(X_s0v2^2)+6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(X_s0v2)+6*rho(0)) && (0 == -1*rho(0)+X_s0v4[0]) && (0 == -1*rho(3*X_s0v2)+X_s0v4[3]) && (0 == -1*rho(2*X_s0v2)+X_s0v4[2]) && (0 == -1*rho(X_s0v2)+X_s0v4[1]) && (0 == -1*BIG_O(X_s0v2)*X_s0v2+BIG_O(X_s0v2^2)) && (0 == -1*BIG_O(X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)) && (0 == -1*BIG_O(X_s0v2)*(X_s0v2^3)+BIG_O(X_s0v2^4)) && (0 == 1/6*rhox3(0)*(X_s0v2^3)+1/2*rhox2(0)*(X_s0v2^2)+rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-1*rho(X_s0v2)+rho(0)) && (0 == 1/6*rhox3(X_s0v2)*(X_s0v2^3)+1/2*rhox2(X_s0v2)*(X_s0v2^2)+rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+rho(X_s0v2)+-1*rho(2*X_s0v2)) && (0 == 1/6*rhox3(2*X_s0v2)*(X_s0v2^3)+1/2*rhox2(2*X_s0v2)*(X_s0v2^2)+rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+rho(2*X_s0v2)+-1*rho(3*X_s0v2)) && (0 == 1/6*rhox3(3*X_s0v2)*(X_s0v2^3)+1/2*rhox2(3*X_s0v2)*(X_s0v2^2)+rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+rho(3*X_s0v2)+-1*rho(4*X_s0v2)) && (0 == -1*rhox2(0)*(X_s0v2^2)+rho(-1*X_s0v2)+X_s0v4[1]+-2*X_s0v4[0]) && (0 == -1*rhox2(3*X_s0v2)*(X_s0v2^2)+rho(4*X_s0v2)+X_s0v4[2]+-2*X_s0v4[3]) && (0 == -1*rhox2(2*X_s0v2)*(X_s0v2^2)+X_s0v4[1]+-2*X_s0v4[2]+X_s0v4[3]) && (0 == -1*rhox2(X_s0v2)*(X_s0v2^2)+-2*X_s0v4[1]+X_s0v4[2]+X_s0v4[0]) && (0 <= -1*rhox3(0)*(X_s0v2^3)+3*rhox2(0)*(X_s0v2^2)+-6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(-1*X_s0v2)+6*rho(0)) && (0 <= -1*rhox3(X_s0v2)*(X_s0v2^3)+3*rhox2(X_s0v2)*(X_s0v2^2)+-6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(X_s0v2)+-6*rho(0)) && (0 <= -1*rhox3(2*X_s0v2)*(X_s0v2^3)+3*rhox2(2*X_s0v2)*(X_s0v2^2)+-6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(X_s0v2)+6*rho(2*X_s0v2)) && (0 <= -1*rhox3(3*X_s0v2)*(X_s0v2^3)+3*rhox2(3*X_s0v2)*(X_s0v2^2)+-6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(2*X_s0v2)+6*rho(3*X_s0v2)) && (0 <= rhox3(0)*(X_s0v2^3)+-3*rhox2(0)*(X_s0v2^2)+6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(-1*X_s0v2)+-6*rho(0)) && (0 <= rhox3(X_s0v2)*(X_s0v2^3)+-3*rhox2(X_s0v2)*(X_s0v2^2)+6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(X_s0v2)+6*rho(0)) && (0 <= rhox3(2*X_s0v2)*(X_s0v2^3)+-3*rhox2(2*X_s0v2)*(X_s0v2^2)+6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(X_s0v2)+-6*rho(2*X_s0v2)) && (0 <= rhox3(3*X_s0v2)*(X_s0v2^3)+-3*rhox2(3*X_s0v2)*(X_s0v2^2)+6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(2*X_s0v2)+-6*rho(3*X_s0v2)) && (0 < X_s0v2)
[junit] Assertion: (0 == BIG_O(X_s0v2^5)*(X_s0v2^2)+rhox2(X_s0v2)*(X_s0v2^2)+2*X_s0v4[1]+-1*X_s0v4[2]+-1*X_s0v4[0]) && (0 == BIG_O(X_s0v2^5)*(X_s0v2^2)+rhox2(2*X_s0v2)*(X_s0v2^2)+-1*X_s0v4[1]+2*X_s0v4[2]+-1*X_s0v4[3])
[junit]
[junit] at f1:27.1-8 "$assert".
[junit] State -1:1002
[junit] | Path condition
[junit] | | (0 == -1*rhox3(0)*(X_s0v2^3)+-6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-3*rho(-1*X_s0v2)+3*X_s0v4[1]) && (0 == -1*rhox3(3*X_s0v2)*(X_s0v2^3)+-6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+3*rho(4*X_s0v2)+-3*X_s0v4[2]) && (0 == -1*rhox3(2*X_s0v2)*(X_s0v2^3)+-6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-3*X_s0v4[1]+3*X_s0v4[3]) && (0 == -1*rhox3(X_s0v2)*(X_s0v2^3)+-6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+3*X_s0v4[2]+-3*X_s0v4[0]) && (0 <= -1*rhox3(3*X_s0v2)*(X_s0v2^3)+-3*rhox2(3*X_s0v2)*(X_s0v2^2)+-6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(3*X_s0v2)+6*rho(4*X_s0v2)) && (0 <= -1*rhox3(2*X_s0v2)*(X_s0v2^3)+-3*rhox2(2*X_s0v2)*(X_s0v2^2)+-6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(2*X_s0v2)+6*rho(3*X_s0v2)) && (0 <= -1*rhox3(X_s0v2)*(X_s0v2^3)+-3*rhox2(X_s0v2)*(X_s0v2^2)+-6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(X_s0v2)+6*rho(2*X_s0v2)) && (0 <= -1*rhox3(0)*(X_s0v2^3)+-3*rhox2(0)*(X_s0v2^2)+-6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(X_s0v2)+-6*rho(0)) && (0 == -1/6*rhox3(0)*(X_s0v2^3)+1/2*rhox2(0)*(X_s0v2^2)+-1*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-1*rho(-1*X_s0v2)+rho(0)) && (0 == -1/6*rhox3(X_s0v2)*(X_s0v2^3)+1/2*rhox2(X_s0v2)*(X_s0v2^2)+-1*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+rho(X_s0v2)+-1*rho(0)) && (0 == -1/6*rhox3(2*X_s0v2)*(X_s0v2^3)+1/2*rhox2(2*X_s0v2)*(X_s0v2^2)+-1*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-1*rho(X_s0v2)+rho(2*X_s0v2)) && (0 == -1/6*rhox3(3*X_s0v2)*(X_s0v2^3)+1/2*rhox2(3*X_s0v2)*(X_s0v2^2)+-1*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-1*rho(2*X_s0v2)+rho(3*X_s0v2)) && (0 <= rhox3(3*X_s0v2)*(X_s0v2^3)+3*rhox2(3*X_s0v2)*(X_s0v2^2)+6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(3*X_s0v2)+-6*rho(4*X_s0v2)) && (0 <= rhox3(2*X_s0v2)*(X_s0v2^3)+3*rhox2(2*X_s0v2)*(X_s0v2^2)+6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(2*X_s0v2)+-6*rho(3*X_s0v2)) && (0 <= rhox3(X_s0v2)*(X_s0v2^3)+3*rhox2(X_s0v2)*(X_s0v2^2)+6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(X_s0v2)+-6*rho(2*X_s0v2)) && (0 <= rhox3(0)*(X_s0v2^3)+3*rhox2(0)*(X_s0v2^2)+6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(X_s0v2)+6*rho(0)) && (0 == -1*rho(0)+X_s0v4[0]) && (0 == -1*rho(3*X_s0v2)+X_s0v4[3]) && (0 == -1*rho(2*X_s0v2)+X_s0v4[2]) && (0 == -1*rho(X_s0v2)+X_s0v4[1]) && (0 == -1*BIG_O(X_s0v2)*X_s0v2+BIG_O(X_s0v2^2)) && (0 == -1*BIG_O(X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)) && (0 == -1*BIG_O(X_s0v2)*(X_s0v2^3)+BIG_O(X_s0v2^4)) && (0 == 1/6*rhox3(0)*(X_s0v2^3)+1/2*rhox2(0)*(X_s0v2^2)+rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-1*rho(X_s0v2)+rho(0)) && (0 == 1/6*rhox3(X_s0v2)*(X_s0v2^3)+1/2*rhox2(X_s0v2)*(X_s0v2^2)+rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+rho(X_s0v2)+-1*rho(2*X_s0v2)) && (0 == 1/6*rhox3(2*X_s0v2)*(X_s0v2^3)+1/2*rhox2(2*X_s0v2)*(X_s0v2^2)+rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+rho(2*X_s0v2)+-1*rho(3*X_s0v2)) && (0 == 1/6*rhox3(3*X_s0v2)*(X_s0v2^3)+1/2*rhox2(3*X_s0v2)*(X_s0v2^2)+rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+rho(3*X_s0v2)+-1*rho(4*X_s0v2)) && (0 == -1*rhox2(0)*(X_s0v2^2)+rho(-1*X_s0v2)+X_s0v4[1]+-2*X_s0v4[0]) && (0 == -1*rhox2(3*X_s0v2)*(X_s0v2^2)+rho(4*X_s0v2)+X_s0v4[2]+-2*X_s0v4[3]) && (0 == -1*rhox2(2*X_s0v2)*(X_s0v2^2)+X_s0v4[1]+-2*X_s0v4[2]+X_s0v4[3]) && (0 == -1*rhox2(X_s0v2)*(X_s0v2^2)+-2*X_s0v4[1]+X_s0v4[2]+X_s0v4[0]) && (0 <= -1*rhox3(0)*(X_s0v2^3)+3*rhox2(0)*(X_s0v2^2)+-6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(-1*X_s0v2)+6*rho(0)) && (0 <= -1*rhox3(X_s0v2)*(X_s0v2^3)+3*rhox2(X_s0v2)*(X_s0v2^2)+-6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(X_s0v2)+-6*rho(0)) && (0 <= -1*rhox3(2*X_s0v2)*(X_s0v2^3)+3*rhox2(2*X_s0v2)*(X_s0v2^2)+-6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(X_s0v2)+6*rho(2*X_s0v2)) && (0 <= -1*rhox3(3*X_s0v2)*(X_s0v2^3)+3*rhox2(3*X_s0v2)*(X_s0v2^2)+-6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(2*X_s0v2)+6*rho(3*X_s0v2)) && (0 <= rhox3(0)*(X_s0v2^3)+-3*rhox2(0)*(X_s0v2^2)+6*rhox1(0)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(-1*X_s0v2)+-6*rho(0)) && (0 <= rhox3(X_s0v2)*(X_s0v2^3)+-3*rhox2(X_s0v2)*(X_s0v2^2)+6*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+-6*rho(X_s0v2)+6*rho(0)) && (0 <= rhox3(2*X_s0v2)*(X_s0v2^3)+-3*rhox2(2*X_s0v2)*(X_s0v2^2)+6*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(X_s0v2)+-6*rho(2*X_s0v2)) && (0 <= rhox3(3*X_s0v2)*(X_s0v2^3)+-3*rhox2(3*X_s0v2)*(X_s0v2^2)+6*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^4)+6*rho(2*X_s0v2)+-6*rho(3*X_s0v2)) && (0 < X_s0v2)
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | h = X_s0v2
[junit] | | | | num_elements = 5
[junit] | | | | initial = X_s0v4
[junit] | | | | working = X_s0v5[0:=(-2*X_s0v4[1]+X_s0v4[2]+X_s0v4[0])/X_s0v2, 1:=(-2*X_s0v4[1]+X_s0v4[2]+X_s0v4[0])/(X_s0v2^2), 2:=(X_s0v4[1]+-2*X_s0v4[2]+X_s0v4[3])/(X_s0v2^2), 3:=(X_s0v4[2]+-2*X_s0v4[3]+X_s0v4[4])/(X_s0v2^2), 4:=(X_s0v4[2]+-2*X_s0v4[3]+-1*X_s0v4[4])/X_s0v2]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 4
[junit] | | dyscope 2 (parent=0, static=3)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | h = X_s0v2
[junit] | | | | n = 5
[junit] | | | | y = pointer<scope<0>,4,ArrayElementRef(Ref<1>,0)>
[junit] | | | | result = pointer<scope<0>,5,ArrayElementRef(Ref<1>,0)>
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=secondDerivative, location=30, f1:27.1-8 "$assert", scope=1]
[junit] | | | | Frame[function=_CIVL_system, location=7, f1:31.1-17 "secondDerivative", scope=0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/secondDerivativeBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : secondDerivativeBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 620
[junit] proverCalls : 17
[junit] memory (bytes) : 875560960
[junit] time (s) : 11.34
[junit] maxProcs : 1
[junit] statesInstantiated : 94
[junit] statesSaved : 13
[junit] statesSeen : 12
[junit] statesMatched : 0
[junit] steps : 26
[junit] transitions : 11
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/secondDerivativeBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 12:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: MAYBE)
[junit] Cannot prove assertion holds: $assert(UNIFORM {int k=1..(n-2)} ((*((result+k))-$D[rho, {x,1}]((($real) k*h)))==$O((((h*h)*h)*h))))
[junit] Path condition: (0 <= -1*rhox2(0)*(X_s0v2^2)+2*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(-1*X_s0v2)+-2*rho(0)) && (0 <= -1*rhox2(X_s0v2)*(X_s0v2^2)+2*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(X_s0v2)+2*rho(0)) && (0 <= -1*rhox2(2*X_s0v2)*(X_s0v2^2)+2*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(X_s0v2)+-2*rho(2*X_s0v2)) && (0 <= -1*rhox2(3*X_s0v2)*(X_s0v2^2)+2*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(2*X_s0v2)+-2*rho(3*X_s0v2)) && (0 == 1/2*rhox2(0)*(X_s0v2^2)+rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+-1*rho(X_s0v2)+rho(0)) && (0 == 1/2*rhox2(X_s0v2)*(X_s0v2^2)+rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+rho(X_s0v2)+-1*rho(2*X_s0v2)) && (0 == 1/2*rhox2(2*X_s0v2)*(X_s0v2^2)+rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+rho(2*X_s0v2)+-1*rho(3*X_s0v2)) && (0 == 1/2*rhox2(3*X_s0v2)*(X_s0v2^2)+rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+rho(3*X_s0v2)+-1*rho(4*X_s0v2)) && (0 == -1*rhox1(0)*X_s0v2+-1/2*rho(-1*X_s0v2)+1/2*X_s0v4[1]) && (0 == -1*rhox1(3*X_s0v2)*X_s0v2+1/2*rho(4*X_s0v2)+-1/2*X_s0v4[2]) && (0 == -1*rhox1(2*X_s0v2)*X_s0v2+-1/2*X_s0v4[1]+1/2*X_s0v4[3]) && (0 == -1*rhox1(X_s0v2)*X_s0v2+1/2*X_s0v4[2]+-1/2*X_s0v4[0]) && (0 <= rhox2(0)*(X_s0v2^2)+2*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(X_s0v2)+2*rho(0)) && (0 <= rhox2(X_s0v2)*(X_s0v2^2)+2*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(X_s0v2)+-2*rho(2*X_s0v2)) && (0 <= rhox2(2*X_s0v2)*(X_s0v2^2)+2*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(2*X_s0v2)+-2*rho(3*X_s0v2)) && (0 <= rhox2(3*X_s0v2)*(X_s0v2^2)+2*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(3*X_s0v2)+-2*rho(4*X_s0v2)) && (0 == 1/2*rhox2(0)*(X_s0v2^2)+-1*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+-1*rho(-1*X_s0v2)+rho(0)) && (0 == 1/2*rhox2(X_s0v2)*(X_s0v2^2)+-1*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+rho(X_s0v2)+-1*rho(0)) && (0 == 1/2*rhox2(2*X_s0v2)*(X_s0v2^2)+-1*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-1*rho(X_s0v2)+rho(2*X_s0v2)) && (0 == 1/2*rhox2(3*X_s0v2)*(X_s0v2^2)+-1*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-1*rho(2*X_s0v2)+rho(3*X_s0v2)) && (0 == -1*rho(0)+X_s0v4[0]) && (0 == -1*rho(3*X_s0v2)+X_s0v4[3]) && (0 == -1*rho(2*X_s0v2)+X_s0v4[2]) && (0 == -1*rho(X_s0v2)+X_s0v4[1]) && (0 == -1*BIG_O(X_s0v2)*X_s0v2+BIG_O(X_s0v2^2)) && (0 == -1*BIG_O(X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)) && (0 <= -1*rhox2(0)*(X_s0v2^2)+-2*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(X_s0v2)+-2*rho(0)) && (0 <= -1*rhox2(X_s0v2)*(X_s0v2^2)+-2*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(X_s0v2)+2*rho(2*X_s0v2)) && (0 <= -1*rhox2(2*X_s0v2)*(X_s0v2^2)+-2*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(2*X_s0v2)+2*rho(3*X_s0v2)) && (0 <= -1*rhox2(3*X_s0v2)*(X_s0v2^2)+-2*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(3*X_s0v2)+2*rho(4*X_s0v2)) && (0 == -1*rhox2(0)*(X_s0v2^2)+BIG_O(X_s0v2^3)+rho(-1*X_s0v2)+X_s0v4[1]+-2*X_s0v4[0]) && (0 == -1*rhox2(3*X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)+rho(4*X_s0v2)+X_s0v4[2]+-2*X_s0v4[3]) && (0 == -1*rhox2(2*X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)+X_s0v4[1]+-2*X_s0v4[2]+X_s0v4[3]) && (0 == -1*rhox2(X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)+-2*X_s0v4[1]+X_s0v4[2]+X_s0v4[0]) && (0 <= rhox2(0)*(X_s0v2^2)+-2*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(-1*X_s0v2)+2*rho(0)) && (0 <= rhox2(X_s0v2)*(X_s0v2^2)+-2*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(X_s0v2)+-2*rho(0)) && (0 <= rhox2(2*X_s0v2)*(X_s0v2^2)+-2*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(X_s0v2)+2*rho(2*X_s0v2)) && (0 <= rhox2(3*X_s0v2)*(X_s0v2^2)+-2*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(2*X_s0v2)+2*rho(3*X_s0v2)) && (0 < X_s0v2)
[junit] Assertion: (0 == BIG_O(X_s0v2^4)*X_s0v2+rhox1(X_s0v2)*X_s0v2+-1/2*X_s0v4[2]+1/2*X_s0v4[0]) && (0 == BIG_O(X_s0v2^4)*X_s0v2+rhox1(2*X_s0v2)*X_s0v2+1/2*X_s0v4[1]+-1/2*X_s0v4[3])
[junit]
[junit] at f2:27.1-8 "$assert".
[junit] State -1:1093
[junit] | Path condition
[junit] | | (0 <= -1*rhox2(0)*(X_s0v2^2)+2*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(-1*X_s0v2)+-2*rho(0)) && (0 <= -1*rhox2(X_s0v2)*(X_s0v2^2)+2*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(X_s0v2)+2*rho(0)) && (0 <= -1*rhox2(2*X_s0v2)*(X_s0v2^2)+2*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(X_s0v2)+-2*rho(2*X_s0v2)) && (0 <= -1*rhox2(3*X_s0v2)*(X_s0v2^2)+2*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(2*X_s0v2)+-2*rho(3*X_s0v2)) && (0 == 1/2*rhox2(0)*(X_s0v2^2)+rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+-1*rho(X_s0v2)+rho(0)) && (0 == 1/2*rhox2(X_s0v2)*(X_s0v2^2)+rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+rho(X_s0v2)+-1*rho(2*X_s0v2)) && (0 == 1/2*rhox2(2*X_s0v2)*(X_s0v2^2)+rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+rho(2*X_s0v2)+-1*rho(3*X_s0v2)) && (0 == 1/2*rhox2(3*X_s0v2)*(X_s0v2^2)+rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+rho(3*X_s0v2)+-1*rho(4*X_s0v2)) && (0 == -1*rhox1(0)*X_s0v2+-1/2*rho(-1*X_s0v2)+1/2*X_s0v4[1]) && (0 == -1*rhox1(3*X_s0v2)*X_s0v2+1/2*rho(4*X_s0v2)+-1/2*X_s0v4[2]) && (0 == -1*rhox1(2*X_s0v2)*X_s0v2+-1/2*X_s0v4[1]+1/2*X_s0v4[3]) && (0 == -1*rhox1(X_s0v2)*X_s0v2+1/2*X_s0v4[2]+-1/2*X_s0v4[0]) && (0 <= rhox2(0)*(X_s0v2^2)+2*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(X_s0v2)+2*rho(0)) && (0 <= rhox2(X_s0v2)*(X_s0v2^2)+2*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(X_s0v2)+-2*rho(2*X_s0v2)) && (0 <= rhox2(2*X_s0v2)*(X_s0v2^2)+2*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(2*X_s0v2)+-2*rho(3*X_s0v2)) && (0 <= rhox2(3*X_s0v2)*(X_s0v2^2)+2*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(3*X_s0v2)+-2*rho(4*X_s0v2)) && (0 == 1/2*rhox2(0)*(X_s0v2^2)+-1*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+-1*rho(-1*X_s0v2)+rho(0)) && (0 == 1/2*rhox2(X_s0v2)*(X_s0v2^2)+-1*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+rho(X_s0v2)+-1*rho(0)) && (0 == 1/2*rhox2(2*X_s0v2)*(X_s0v2^2)+-1*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-1*rho(X_s0v2)+rho(2*X_s0v2)) && (0 == 1/2*rhox2(3*X_s0v2)*(X_s0v2^2)+-1*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-1*rho(2*X_s0v2)+rho(3*X_s0v2)) && (0 == -1*rho(0)+X_s0v4[0]) && (0 == -1*rho(3*X_s0v2)+X_s0v4[3]) && (0 == -1*rho(2*X_s0v2)+X_s0v4[2]) && (0 == -1*rho(X_s0v2)+X_s0v4[1]) && (0 == -1*BIG_O(X_s0v2)*X_s0v2+BIG_O(X_s0v2^2)) && (0 == -1*BIG_O(X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)) && (0 <= -1*rhox2(0)*(X_s0v2^2)+-2*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(X_s0v2)+-2*rho(0)) && (0 <= -1*rhox2(X_s0v2)*(X_s0v2^2)+-2*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(X_s0v2)+2*rho(2*X_s0v2)) && (0 <= -1*rhox2(2*X_s0v2)*(X_s0v2^2)+-2*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(2*X_s0v2)+2*rho(3*X_s0v2)) && (0 <= -1*rhox2(3*X_s0v2)*(X_s0v2^2)+-2*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(3*X_s0v2)+2*rho(4*X_s0v2)) && (0 == -1*rhox2(0)*(X_s0v2^2)+BIG_O(X_s0v2^3)+rho(-1*X_s0v2)+X_s0v4[1]+-2*X_s0v4[0]) && (0 == -1*rhox2(3*X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)+rho(4*X_s0v2)+X_s0v4[2]+-2*X_s0v4[3]) && (0 == -1*rhox2(2*X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)+X_s0v4[1]+-2*X_s0v4[2]+X_s0v4[3]) && (0 == -1*rhox2(X_s0v2)*(X_s0v2^2)+BIG_O(X_s0v2^3)+-2*X_s0v4[1]+X_s0v4[2]+X_s0v4[0]) && (0 <= rhox2(0)*(X_s0v2^2)+-2*rhox1(0)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(-1*X_s0v2)+2*rho(0)) && (0 <= rhox2(X_s0v2)*(X_s0v2^2)+-2*rhox1(X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+2*rho(X_s0v2)+-2*rho(0)) && (0 <= rhox2(2*X_s0v2)*(X_s0v2^2)+-2*rhox1(2*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(X_s0v2)+2*rho(2*X_s0v2)) && (0 <= rhox2(3*X_s0v2)*(X_s0v2^2)+-2*rhox1(3*X_s0v2)*X_s0v2+BIG_O(X_s0v2^3)+-2*rho(2*X_s0v2)+2*rho(3*X_s0v2)) && (0 < X_s0v2)
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | h = X_s0v2
[junit] | | | | num_elements = 5
[junit] | | | | initial = X_s0v4
[junit] | | | | working = X_s0v5[0:=(X_s0v4[1]+-1*X_s0v4[0])/X_s0v2, 1:=(1/2*X_s0v4[2]+-1/2*X_s0v4[0])/X_s0v2, 2:=(-1/2*X_s0v4[1]+1/2*X_s0v4[3])/X_s0v2, 3:=(-1/2*X_s0v4[2]+1/2*X_s0v4[4])/X_s0v2, 4:=(-1*X_s0v4[3]+X_s0v4[4])/X_s0v2]
[junit] | | dyscope 1 (parent=2, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 4
[junit] | | | | __anon_0 = NULL
[junit] | | dyscope 2 (parent=0, static=4)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | h = X_s0v2
[junit] | | | | n = 5
[junit] | | | | y = pointer<scope<0>,4,ArrayElementRef(Ref<1>,0)>
[junit] | | | | result = pointer<scope<0>,5,ArrayElementRef(Ref<1>,0)>
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=differentiate, location=29, f2:27.1-8 "$assert", scope=1]
[junit] | | | | Frame[function=_CIVL_system, location=7, f2:32.1-14 "differentiate", scope=0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/derivativeBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : stdio.h
[junit] f2 : derivativeBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 682
[junit] proverCalls : 20
[junit] memory (bytes) : 875560960
[junit] time (s) : 12.11
[junit] maxProcs : 1
[junit] statesInstantiated : 91
[junit] statesSaved : 13
[junit] statesSeen : 12
[junit] statesMatched : 0
[junit] steps : 25
[junit] transitions : 11
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/derivativeBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 835
[junit] proverCalls : 29
[junit] memory (bytes) : 876085248
[junit] time (s) : 13.59
[junit] maxProcs : 1
[junit] statesInstantiated : 265
[junit] statesSaved : 40
[junit] statesSeen : 38
[junit] statesMatched : 0
[junit] steps : 78
[junit] transitions : 37
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 906
[junit] proverCalls : 31
[junit] memory (bytes) : 876085248
[junit] time (s) : 14.12
[junit] maxProcs : 1
[junit] statesInstantiated : 102
[junit] statesSaved : 14
[junit] statesSeen : 13
[junit] statesMatched : 0
[junit] steps : 28
[junit] transitions : 12
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 1009
[junit] proverCalls : 33
[junit] memory (bytes) : 876085248
[junit] time (s) : 15.5
[junit] maxProcs : 1
[junit] statesInstantiated : 182
[junit] statesSaved : 23
[junit] statesSeen : 22
[junit] statesMatched : 0
[junit] steps : 53
[junit] transitions : 21
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.ArithmeticTest
[junit] Tests run: 13, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 5.875 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 171
[junit] proverCalls : 14
[junit] memory (bytes) : 876085248
[junit] time (s) : 0.18
[junit] maxProcs : 1
[junit] statesInstantiated : 260
[junit] statesSaved : 51
[junit] statesSeen : 46
[junit] statesMatched : 0
[junit] steps : 75
[junit] transitions : 45
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 33628
[junit] proverCalls : 516
[junit] memory (bytes) : 844627968
[junit] time (s) : 2.87
[junit] maxProcs : 1
[junit] statesInstantiated : 34574
[junit] statesSaved : 6747
[junit] statesSeen : 6747
[junit] statesMatched : 0
[junit] steps : 12381
[junit] transitions : 6746
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 33647
[junit] proverCalls : 516
[junit] memory (bytes) : 844627968
[junit] time (s) : 2.99
[junit] maxProcs : 1
[junit] statesInstantiated : 48
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 15
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: DIVISION_BY_ZERO, certainty: PROVEABLE)
[junit] Division by zero
[junit] at f1:12.13-16 "x/y".
[junit] State -1:36538
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | x = X_s0v2
[junit] | | | | y = X_s0v3
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | z = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, f1:11.12-13 "{", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/divisionBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : divisionBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 33652
[junit] proverCalls : 517
[junit] memory (bytes) : 844627968
[junit] time (s) : 3.1
[junit] maxProcs : 0
[junit] statesInstantiated : 13
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/divisionBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 34091
[junit] proverCalls : 520
[junit] memory (bytes) : 844627968
[junit] time (s) : 3.24
[junit] maxProcs : 1
[junit] statesInstantiated : 666
[junit] statesSaved : 110
[junit] statesSeen : 110
[junit] statesMatched : 0
[junit] steps : 191
[junit] transitions : 109
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] civl verify -echo=true examples/arithmetic/math.cvl
[junit] y=exp(X_s0v2)
[junit] z=exp(X_s0v2)
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 34101
[junit] proverCalls : 520
[junit] memory (bytes) : 844627968
[junit] time (s) : 3.45
[junit] maxProcs : 1
[junit] statesInstantiated : 33
[junit] statesSaved : 4
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 34700
[junit] proverCalls : 565
[junit] memory (bytes) : 844627968
[junit] time (s) : 3.7
[junit] maxProcs : 1
[junit] statesInstantiated : 892
[junit] statesSaved : 161
[junit] statesSeen : 143
[junit] statesMatched : 0
[junit] steps : 262
[junit] transitions : 142
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 34851
[junit] proverCalls : 613
[junit] memory (bytes) : 844627968
[junit] time (s) : 3.9
[junit] maxProcs : 1
[junit] statesInstantiated : 236
[junit] statesSaved : 58
[junit] statesSeen : 39
[junit] statesMatched : 0
[junit] steps : 73
[junit] transitions : 38
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 34859
[junit] proverCalls : 614
[junit] memory (bytes) : 844627968
[junit] time (s) : 4.0
[junit] maxProcs : 1
[junit] statesInstantiated : 24
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 6
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 295:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((C[i][j]==D[i][j]))
[junit] Path condition: true
[junit] Assertion: 0 == X_s0v7[0][2]*X_s0v8[2][0]
[junit]
[junit] at f1:68.6-13 "$assert".
[junit] State -1:40184
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | BOUND = 3
[junit] | | | | L = 3
[junit] | | | | M = 3
[junit] | | | | N = 3
[junit] | | | | TILE_SIZE = 2
[junit] | | | | A = X_s0v7
[junit] | | | | B = X_s0v8
[junit] | | | | C = X_s0v9[0:=X_s0v9[0][0:=X_s0v7[0][1]*X_s0v8[1][0]+X_s0v7[0][2]*X_s0v8[2][0]+X_s0v7[0][0]*X_s0v8[0][0], 1:=X_s0v7[0][1]*X_s0v8[1][1]+X_s0v7[0][2]*X_s0v8[2][1]+X_s0v7[0][0]*X_s0v8[0][1], 2:=X_s0v7[0][1]*X_s0v8[1][2]+X_s0v7[0][2]*X_s0v8[2][2]+X_s0v7[0][0]*X_s0v8[0][2]], 1:=X_s0v9[1][0:=X_s0v7[1][1]*X_s0v8[1][0]+X_s0v7[1][2]*X_s0v8[2][0]+X_s0v7[1][0]*X_s0v8[0][0], 1:=X_s0v7[1][1]*X_s0v8[1][1]+X_s0v7[1][2]*X_s0v8[2][1]+X_s0v7[1][0]*X_s0v8[0][1], 2:=X_s0v7[1][1]*X_s0v8[1][2]+X_s0v7[1][2]*X_s0v8[2][2]+X_s0v7[1][0]*X_s0v8[0][2]], 2:=X_s0v9[2][0:=X_s0v7[2][1]*X_s0v8[1][0]+X_s0v7[2][2]*X_s0v8[2][0]+X_s0v7[2][0]*X_s0v8[0][0], 1:=X_s0v7[2][1]*X_s0v8[1][1]+X_s0v7[2][2]*X_s0v8[2][1]+X_s0v7[2][0]*X_s0v8[0][1], 2:=X_s0v7[2][1]*X_s0v8[1][2]+X_s0v7[2][2]*X_s0v8[2][2]+X_s0v7[2][0]*X_s0v8[0][2]]]
[junit] | | | | D = X_s0v10[0:=X_s0v10[0][0:=X_s0v7[0][1]*X_s0v8[1][0]+X_s0v7[0][0]*X_s0v8[0][0], 1:=X_s0v7[0][1]*X_s0v8[1][1]+X_s0v7[0][0]*X_s0v8[0][1], 2:=X_s0v7[0][1]*X_s0v8[1][2]+X_s0v7[0][0]*X_s0v8[0][2]], 1:=X_s0v10[1][0:=X_s0v7[1][1]*X_s0v8[1][0]+X_s0v7[1][0]*X_s0v8[0][0], 1:=X_s0v7[1][1]*X_s0v8[1][1]+X_s0v7[1][0]*X_s0v8[0][1], 2:=X_s0v7[1][1]*X_s0v8[1][2]+X_s0v7[1][0]*X_s0v8[0][2]], 2:=X_s0v10[2][0:=X_s0v7[2][1]*X_s0v8[1][0]+2*X_s0v7[2][2]*X_s0v8[2][0]+X_s0v7[2][0]*X_s0v8[0][0], 1:=X_s0v7[2][1]*X_s0v8[1][1]+2*X_s0v7[2][2]*X_s0v8[2][1]+X_s0v7[2][0]*X_s0v8[0][1], 2:=X_s0v7[2][1]*X_s0v8[1][2]+2*X_s0v7[2][2]*X_s0v8[2][2]+X_s0v7[2][0]*X_s0v8[0][2]]]
[junit] | | dyscope 1 (parent=2, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 2 (parent=0, static=4)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=25, f1:68.6-13 "$assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/matmatBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : matmatBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 36184
[junit] proverCalls : 659
[junit] memory (bytes) : 816840704
[junit] time (s) : 4.38
[junit] maxProcs : 1
[junit] statesInstantiated : 1795
[junit] statesSaved : 303
[junit] statesSeen : 295
[junit] statesMatched : 0
[junit] steps : 531
[junit] transitions : 294
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/matmatBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 43:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == -1/10*X_s0v4[1]+-1/10*X_s0v4[2]+-1/10*X_s0v4[3]+-1/10*X_s0v4[4]+-1/10*X_s0v4[5]+-1/10*X_s0v4[6]+-1/10*X_s0v4[7]+-1/10*X_s0v4[8]+-1/10*X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:40432
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 10
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/10*X_s0v4[1]+1/10*X_s0v4[2]+1/10*X_s0v4[3]+1/10*X_s0v4[4]+1/10*X_s0v4[5]+1/10*X_s0v4[6]+1/10*X_s0v4[7]+1/10*X_s0v4[8]+1/10*X_s0v4[9]+1/10*X_s0v4[0]
[junit] | | | | result2 = 1/10*X_s0v4[9]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 10
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/10*X_s0v4[9]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/meanBad_0.trace
[junit] Restricting search depth to 42
[junit] Error 1 encountered at depth 39:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == -1/9*X_s0v4[1]+-1/9*X_s0v4[2]+-1/9*X_s0v4[3]+-1/9*X_s0v4[4]+-1/9*X_s0v4[5]+-1/9*X_s0v4[6]+-1/9*X_s0v4[7]+-1/9*X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:40544
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 9
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/9*X_s0v4[1]+1/9*X_s0v4[2]+1/9*X_s0v4[3]+1/9*X_s0v4[4]+1/9*X_s0v4[5]+1/9*X_s0v4[6]+1/9*X_s0v4[7]+1/9*X_s0v4[8]+1/9*X_s0v4[0]
[junit] | | | | result2 = 1/9*X_s0v4[8]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 9
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/9*X_s0v4[8]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (39) is less than length of old (43): replacing old with new...
[junit] Restricting search depth to 38
[junit] Error 2 encountered at depth 35:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == -1/8*X_s0v4[1]+-1/8*X_s0v4[2]+-1/8*X_s0v4[3]+-1/8*X_s0v4[4]+-1/8*X_s0v4[5]+-1/8*X_s0v4[6]+-1/8*X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:40646
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 8
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/8*X_s0v4[1]+1/8*X_s0v4[2]+1/8*X_s0v4[3]+1/8*X_s0v4[4]+1/8*X_s0v4[5]+1/8*X_s0v4[6]+1/8*X_s0v4[7]+1/8*X_s0v4[0]
[junit] | | | | result2 = 1/8*X_s0v4[7]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 8
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/8*X_s0v4[7]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (35) is less than length of old (39): replacing old with new...
[junit] Restricting search depth to 34
[junit] Error 3 encountered at depth 31:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == -1/7*X_s0v4[1]+-1/7*X_s0v4[2]+-1/7*X_s0v4[3]+-1/7*X_s0v4[4]+-1/7*X_s0v4[5]+-1/7*X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:40738
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 7
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/7*X_s0v4[1]+1/7*X_s0v4[2]+1/7*X_s0v4[3]+1/7*X_s0v4[4]+1/7*X_s0v4[5]+1/7*X_s0v4[6]+1/7*X_s0v4[0]
[junit] | | | | result2 = 1/7*X_s0v4[6]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 7
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/7*X_s0v4[6]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (31) is less than length of old (35): replacing old with new...
[junit] Restricting search depth to 30
[junit] Error 4 encountered at depth 27:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == -1/6*X_s0v4[1]+-1/6*X_s0v4[2]+-1/6*X_s0v4[3]+-1/6*X_s0v4[4]+-1/6*X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:40820
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 6
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/6*X_s0v4[1]+1/6*X_s0v4[2]+1/6*X_s0v4[3]+1/6*X_s0v4[4]+1/6*X_s0v4[5]+1/6*X_s0v4[0]
[junit] | | | | result2 = 1/6*X_s0v4[5]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 6
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/6*X_s0v4[5]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (27) is less than length of old (31): replacing old with new...
[junit] Restricting search depth to 26
[junit] Error 5 encountered at depth 23:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == -1/5*X_s0v4[1]+-1/5*X_s0v4[2]+-1/5*X_s0v4[3]+-1/5*X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:40892
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 5
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/5*X_s0v4[1]+1/5*X_s0v4[2]+1/5*X_s0v4[3]+1/5*X_s0v4[4]+1/5*X_s0v4[0]
[junit] | | | | result2 = 1/5*X_s0v4[4]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 5
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/5*X_s0v4[4]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[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] Error 6 encountered at depth 19:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == -1/4*X_s0v4[1]+-1/4*X_s0v4[2]+-1/4*X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:40954
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 4
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/4*X_s0v4[1]+1/4*X_s0v4[2]+1/4*X_s0v4[3]+1/4*X_s0v4[0]
[junit] | | | | result2 = 1/4*X_s0v4[3]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 4
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/4*X_s0v4[3]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (19) is less than length of old (23): replacing old with new...
[junit] Restricting search depth to 18
[junit] Error 7 encountered at depth 15:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == -1/3*X_s0v4[1]+-1/3*X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:41006
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 3
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/3*X_s0v4[1]+1/3*X_s0v4[2]+1/3*X_s0v4[0]
[junit] | | | | result2 = 1/3*X_s0v4[2]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 3
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/3*X_s0v4[2]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (15) is less than length of old (19): replacing old with new...
[junit] Restricting search depth to 14
[junit] Error 8 encountered at depth 11:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((result1==result2))
[junit] Path condition: true
[junit] Assertion: 0 == X_s0v4[0]
[junit]
[junit] at f1:30.2-9 "$assert".
[junit] State -1:41048
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 10
[junit] | | | | n = 2
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result1 = 1/2*X_s0v4[1]+1/2*X_s0v4[0]
[junit] | | | | result2 = 1/2*X_s0v4[1]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 2
[junit] | | dyscope 3 (parent=4, static=7)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | result = 1/2*X_s0v4[1]
[junit] | | dyscope 4 (parent=1, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:30.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (11) is less than length of old (15): replacing old with new...
[junit] Restricting search depth to 10
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 36809
[junit] proverCalls : 722
[junit] memory (bytes) : 816840704
[junit] time (s) : 4.65
[junit] maxProcs : 1
[junit] statesInstantiated : 901
[junit] statesSaved : 169
[junit] statesSeen : 143
[junit] statesMatched : 0
[junit] steps : 262
[junit] transitions : 142
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/meanBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 36922
[junit] proverCalls : 722
[junit] memory (bytes) : 816840704
[junit] time (s) : 4.77
[junit] maxProcs : 1
[junit] statesInstantiated : 237
[junit] statesSaved : 37
[junit] statesSeen : 37
[junit] statesMatched : 0
[junit] steps : 67
[junit] transitions : 36
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] civl verify -echo=true examples/arithmetic/multiplicationInLoopCondition.cvl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 37397
[junit] proverCalls : 938
[junit] memory (bytes) : 816840704
[junit] time (s) : 5.88
[junit] maxProcs : 1
[junit] statesInstantiated : 709
[junit] statesSaved : 215
[junit] statesSeen : 145
[junit] statesMatched : 0
[junit] steps : 221
[junit] transitions : 144
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.CompareTest
[junit] Tests run: 1, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 0.323 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 243
[junit] proverCalls : 0
[junit] memory (bytes) : 816840704
[junit] time (s) : 0.33
[junit] maxProcs : 3
[junit] statesInstantiated : 554
[junit] statesSaved : 78
[junit] statesSeen : 78
[junit] statesMatched : 35
[junit] steps : 163
[junit] transitions : 112
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.ConcurrencyTest
[junit] Tests run: 20, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 8.005 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 48220
[junit] proverCalls : 17
[junit] memory (bytes) : 816840704
[junit] time (s) : 1.64
[junit] maxProcs : 5
[junit] statesInstantiated : 73204
[junit] statesSaved : 3461
[junit] statesSeen : 3455
[junit] statesMatched : 4614
[junit] steps : 23072
[junit] transitions : 8068
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 48655
[junit] proverCalls : 17
[junit] memory (bytes) : 816840704
[junit] time (s) : 1.76
[junit] maxProcs : 5
[junit] statesInstantiated : 642
[junit] statesSaved : 84
[junit] statesSeen : 84
[junit] statesMatched : 17
[junit] steps : 185
[junit] transitions : 100
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 50788
[junit] proverCalls : 28
[junit] memory (bytes) : 776470528
[junit] time (s) : 1.93
[junit] maxProcs : 5
[junit] statesInstantiated : 1860
[junit] statesSaved : 281
[junit] statesSeen : 277
[junit] statesMatched : 167
[junit] steps : 598
[junit] transitions : 443
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 45:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((seq==par))
[junit] Path condition: true
[junit] Assertion: 0 == X_s0v4[2]
[junit]
[junit] at f1:45.2-9 "$assert".
[junit] State -1:118619
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | seq = X_s0v4[1]+X_s0v4[2]+X_s0v4[3]+X_s0v4[0]
[junit] | | | | par = X_s0v4[1]+X_s0v4[3]+X_s0v4[0]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | s = X_s0v4[1]+X_s0v4[3]+X_s0v4[0]
[junit] | | | | workers = X_s2v2[0:=process<-1>, 1:=process<-1>, 2:=process<-1>, 3:=process<-1>]
[junit] | | dyscope 3 (parent=0, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | p = pointer<scope<0>,4,ArrayElementRef(Ref<1>,0)>
[junit] | | | | n = 4
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:45.2-9 "$assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/adderBad_0.trace
[junit] Restricting search depth to 44
[junit] Error 1 encountered at depth 36:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((seq==par))
[junit] Path condition: true
[junit] Assertion: 0 == X_s0v4[1]
[junit]
[junit] at f1:45.2-9 "$assert".
[junit] State -1:130626
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | seq = X_s0v4[1]+X_s0v4[2]+X_s0v4[0]
[junit] | | | | par = X_s0v4[2]+X_s0v4[0]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | s = X_s0v4[2]+X_s0v4[0]
[junit] | | | | workers = X_s2v2[0:=process<-1>, 1:=process<-1>, 2:=process<-1>]
[junit] | | dyscope 3 (parent=0, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | p = pointer<scope<0>,4,ArrayElementRef(Ref<1>,0)>
[junit] | | | | n = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:45.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (36) is less than length of old (45): replacing old with new...
[junit] Restricting search depth to 35
[junit] Error 2 encountered at depth 27:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((seq==par))
[junit] Path condition: true
[junit] Assertion: 0 == X_s0v4[0]
[junit]
[junit] at f1:45.2-9 "$assert".
[junit] State -1:131964
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 2
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | seq = X_s0v4[1]+X_s0v4[0]
[junit] | | | | par = X_s0v4[1]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | s = X_s0v4[1]
[junit] | | | | workers = X_s2v2[0:=process<-1>, 1:=process<-1>]
[junit] | | dyscope 3 (parent=0, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | p = pointer<scope<0>,4,ArrayElementRef(Ref<1>,0)>
[junit] | | | | n = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:45.2-9 "$assert", scope=1]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (27) is less than length of old (36): replacing old with new...
[junit] Restricting search depth to 26
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 59650
[junit] proverCalls : 54
[junit] memory (bytes) : 776470528
[junit] time (s) : 2.49
[junit] maxProcs : 5
[junit] statesInstantiated : 13889
[junit] statesSaved : 1922
[junit] statesSeen : 1914
[junit] statesMatched : 619
[junit] steps : 3967
[junit] transitions : 2532
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/adderBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = NULL
[junit] | | | | N = NULL
[junit] | | | | a = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, f1:8.0-6 "$input", scope=0]
[junit]
[junit]
[junit] Transition 1: State 0, proc 0:
[junit] 0->1: B = 4 at f1:8.0-12 "$input int B";
[junit] 1->2: N = InitialValue(N) at f1:9.0-12 "$input int N";
[junit] 2->3: $assume ((0<=N)&&(N<=B)) at f1:10.0-20 "$assume 0<=N && N ... B";
[junit] 3->6: a = InitialValue(a) at f1:11.0-18 "$input double a[N]";
[junit] --> State 1
[junit]
[junit] Transition 2: State 1, proc 0:
[junit] 6->12: seq = adderSeq(&a[0], N) at f1:42.15-33 "adderSeq(&a[0], ... )";
[junit] --> State 2
[junit]
[junit] Transition 3: State 2, proc 0:
[junit] 12->13: s = 0.0 at f1:14.2-16 "double s = 0.0";
[junit] 13->14: i = 0 at f1:16.7-16 "int i = 0";
[junit] --> State 3
[junit]
[junit] Transition 4: State 3, proc 0:
[junit] 14->17: LOOP_TRUE_BRANCH at f1:16.18-23 "i < n";
[junit] --> State 5
[junit]
[junit] Transition 5: State 5, proc 0:
[junit] 17->19: s = (s+*((p+i))) at f1:17.4-13 "s += p[i]";
[junit] 19->14: i = (i+1) at f1:16.25-28 "i++";
[junit] --> State 6
[junit]
[junit] Transition 6: State 6, proc 0:
[junit] 14->17: LOOP_TRUE_BRANCH at f1:16.18-23 "i < n";
[junit] --> State 8
[junit]
[junit] Transition 7: State 8, proc 0:
[junit] 17->19: s = (s+*((p+i))) at f1:17.4-13 "s += p[i]";
[junit] 19->14: i = (i+1) at f1:16.25-28 "i++";
[junit] --> State 9
[junit]
[junit] Transition 8: State 9, proc 0:
[junit] 14->20: LOOP_FALSE_BRANCH at f1:16.18-23 "i < n";
[junit] 20->RET: return s (adderSeq) at f1:19.2-11 "return s;";
[junit] --> State 11
[junit]
[junit] Transition 9: State 11, proc 0:
[junit] 8->21: par = adderPar(&a[0], N) at f1:43.15-33 "adderPar(&a[0], ... )";
[junit] --> State 12
[junit]
[junit] Transition 10: State 12, proc 0:
[junit] 21->22: s = 0.0 at f1:23.2-16 "double s = 0.0";
[junit] 22->23: workers = InitialValue(workers) at f1:24.2-18 "$proc workers[n]";
[junit] 23->24: j = 0 at f1:34.7-16 "int j = 0";
[junit] --> State 13
[junit]
[junit] Transition 11: State 13, proc 0:
[junit] 24->26: LOOP_TRUE_BRANCH at f1:34.18-23 "j < n";
[junit] --> State 14
[junit]
[junit] Transition 12: State 14, proc 0:
[junit] 26->28: workers[j] = $spawn worker(j) at f1:35.17-33 "$spawn worker(j)";
[junit] 28->24: j = (j+1) at f1:34.25-28 "j++";
[junit] --> State 15
[junit]
[junit] Transition 13: State 15, proc 0:
[junit] 24->26: LOOP_TRUE_BRANCH at f1:34.18-23 "j < n";
[junit] --> State 16
[junit]
[junit] Transition 14: State 16, proc 0:
[junit] 26->28: workers[j] = $spawn worker(j) at f1:35.17-33 "$spawn worker(j)";
[junit] 28->24: j = (j+1) at f1:34.25-28 "j++";
[junit] --> State 17
[junit]
[junit] Transition 15: State 17, proc 0:
[junit] 24->29: LOOP_FALSE_BRANCH at f1:34.18-23 "j < n";
[junit] 29->30: j = 0 at f1:36.7-16 "int j = 0";
[junit] --> State 18
[junit]
[junit] Transition 16: State 18, proc 0:
[junit] 30->32: LOOP_TRUE_BRANCH at f1:36.18-23 "j < n";
[junit] --> State 19
[junit]
[junit] Transition 17: State 19, proc 1:
[junit] 38->40: t = s at f1:29.4-9 "t = s";
[junit] --> State 20
[junit]
[junit] Transition 18: State 20, proc 1:
[junit] 40->42: t = (t+*((p+i))) at f1:30.4-13 "t += p[i]";
[junit] --> State 21
[junit]
[junit] Transition 19: State 21, proc 2:
[junit] 38->40: t = s at f1:29.4-9 "t = s";
[junit] --> State 22
[junit]
[junit] Transition 20: State 22, proc 2:
[junit] 40->42: t = (t+*((p+i))) at f1:30.4-13 "t += p[i]";
[junit] --> State 23
[junit]
[junit] Transition 21: State 23, proc 1:
[junit] 42->43: s = t at f1:31.4-9 "s = t";
[junit] 43->RET: return (worker) at f1:32.2-3 "}";
[junit] --> State 24
[junit]
[junit] Transition 22: State 24, proc 0:
[junit] 32->34: $wait(workers[j]) at f1:37.4-21 "$wait(workers[j])";
[junit] 34->30: j = (j+1) at f1:36.25-28 "j++";
[junit] --> State 25
[junit]
[junit] Transition 23: State 25, proc 0:
[junit] 30->32: LOOP_TRUE_BRANCH at f1:36.18-23 "j < n";
[junit] --> State 26
[junit]
[junit] Transition 24: State 26, proc 1:
[junit] 42->43: s = t at f1:31.4-9 "s = t";
[junit] 43->RET: return (worker) at f1:32.2-3 "}";
[junit] --> State 27
[junit]
[junit] Transition 25: State 27, proc 0:
[junit] 32->34: $wait(workers[j]) at f1:37.4-21 "$wait(workers[j])";
[junit] 34->30: j = (j+1) at f1:36.25-28 "j++";
[junit] --> State 28
[junit]
[junit] Transition 26: State 28, proc 0:
[junit] 30->35: LOOP_FALSE_BRANCH at f1:36.18-23 "j < n";
[junit] --> State 29
[junit]
[junit] Transition 27: State 29, proc 0:
[junit] 35->RET: return s (adderPar) at f1:38.2-11 "return s;";
[junit] Error 0:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((seq==par))
[junit] Path condition: true
[junit] Assertion: 0 == X_s0v4[0]
[junit]
[junit] at f1:45.2-9 "$assert".
[junit] State -1:132353
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 2
[junit] | | | | a = X_s0v4
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | seq = X_s0v4[1]+X_s0v4[0]
[junit] | | | | par = X_s0v4[1]
[junit] | | dyscope 2 (parent=3, static=8)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | s = X_s0v4[1]
[junit] | | | | workers = X_s2v2[0:=process<-1>, 1:=process<-1>]
[junit] | | dyscope 3 (parent=0, static=4)
[junit] | | | reachers = {}
[junit] | | | variables
[junit] | | | | p = pointer<scope<0>,4,ArrayElementRef(Ref<1>,0)>
[junit] | | | | n = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:45.2-9 "$assert", scope=1]
[junit]
[junit] 10->11: $assert((seq==par)) at f1:45.2-9 "$assert";
[junit] 11->RET: return (_CIVL_system) at f1:46.0-1 "}";
[junit] --> State 30
[junit] Trace ends after 27 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 59754
[junit] proverCalls : 65
[junit] memory (bytes) : 776470528
[junit] time (s) : 2.63
[junit] statesInstantiated : 179
[junit] statesSaved : 31
[junit] maxProcs : 3
[junit]
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 59785
[junit] proverCalls : 65
[junit] memory (bytes) : 776470528
[junit] time (s) : 2.64
[junit] maxProcs : 3
[junit] statesInstantiated : 65
[junit] statesSaved : 4
[junit] statesSeen : 4
[junit] statesMatched : 2
[junit] steps : 17
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 61173
[junit] proverCalls : 65
[junit] memory (bytes) : 776470528
[junit] time (s) : 2.77
[junit] maxProcs : 3
[junit] statesInstantiated : 2711
[junit] statesSaved : 423
[junit] statesSeen : 423
[junit] statesMatched : 121
[junit] steps : 835
[junit] transitions : 543
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 80587
[junit] proverCalls : 78
[junit] memory (bytes) : 776470528
[junit] time (s) : 3.15
[junit] maxProcs : 5
[junit] statesInstantiated : 32236
[junit] statesSaved : 1400
[junit] statesSeen : 1394
[junit] statesMatched : 1708
[junit] steps : 9250
[junit] transitions : 3101
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 92513
[junit] proverCalls : 119
[junit] memory (bytes) : 776470528
[junit] time (s) : 3.6
[junit] maxProcs : 3
[junit] statesInstantiated : 10054
[junit] statesSaved : 1983
[junit] statesSeen : 1948
[junit] statesMatched : 0
[junit] steps : 2953
[junit] transitions : 1947
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 68:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/diningBad_0.trace
[junit] Restricting search depth to 67
[junit] Error 1 encountered at depth 63:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (63) is less than length of old (68): replacing old with new...
[junit] Restricting search depth to 62
[junit] Error 2 encountered at depth 58:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (58) is less than length of old (63): replacing old with new...
[junit] Restricting search depth to 57
[junit] Error 3 encountered at depth 53:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (53) is less than length of old (58): replacing old with new...
[junit] Restricting search depth to 52
[junit] Error 4 encountered at depth 48:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (48) is less than length of old (53): replacing old with new...
[junit] Restricting search depth to 47
[junit] Error 5 encountered at depth 43:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (43) is less than length of old (48): replacing old with new...
[junit] Restricting search depth to 42
[junit] Error 6 encountered at depth 38:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (38) is less than length of old (43): replacing old with new...
[junit] Restricting search depth to 37
[junit] Error 7 encountered at depth 33:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (33) is less than length of old (38): replacing old with new...
[junit] Restricting search depth to 32
[junit] Error 8 encountered at depth 28:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 73
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 4
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 3
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 3
[junit] | | | | right = 0
[junit] | | dyscope 8 (parent=0, static=1)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | id = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (28) is less than length of old (33): replacing old with new...
[junit] Restricting search depth to 27
[junit] Error 9 encountered at depth 27:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 171
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 3
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 0
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (27) is less than length of old (28): replacing old with new...
[junit] Restricting search depth to 26
[junit] Error 10 encountered at depth 22:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 171
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2,3}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 3
[junit] | | | | forks = X_s0v4[0:=1, 1:=1, 2:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 2
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 2
[junit] | | | | right = 0
[junit] | | dyscope 6 (parent=0, static=1)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (22) is less than length of old (27): replacing old with new...
[junit] Restricting search depth to 21
[junit] Error 11 encountered at depth 21:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 208
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 2
[junit] | | | | forks = X_s0v4[0:=1, 1:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 0
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (21) is less than length of old (22): replacing old with new...
[junit] Restricting search depth to 20
[junit] Error 12 encountered at depth 16:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] at f0:21.30-42 "forks[right]".
[junit] State 208
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 2
[junit] | | | | forks = X_s0v4[0:=1, 1:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 0
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (16) is less than length of old (21): replacing old with new...
[junit] Restricting search depth to 15
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 95262
[junit] proverCalls : 128
[junit] memory (bytes) : 750256128
[junit] time (s) : 3.81
[junit] maxProcs : 5
[junit] statesInstantiated : 1874
[junit] statesSaved : 209
[junit] statesSeen : 383
[junit] statesMatched : 155
[junit] steps : 578
[junit] transitions : 537
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/diningBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = NULL
[junit] | | | | n = NULL
[junit] | | | | forks = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, f0:9.0-6 "$input", scope=0]
[junit]
[junit]
[junit] Transition 1: State 0, proc 0:
[junit] 0->1: B = 4 at f0:9.0-12 "$input int B";
[junit] 1->2: n = InitialValue(n) at f0:10.0-12 "$input int n";
[junit] 2->3: $assume ((2<=n)&&(n<=B)) at f0:11.0-20 "$assume 2<=n && n ... B";
[junit] 3->5: forks = InitialValue(forks) at f0:13.0-12 "int forks[n]";
[junit] 5->6: i = 0 at f0:28.7-16 "int i = 0";
[junit] --> State 1
[junit]
[junit] Transition 2: State 1, proc 0:
[junit] 6->8: LOOP_TRUE_BRANCH at f0:28.18-23 "i < n";
[junit] --> State 2
[junit]
[junit] Transition 3: State 2, proc 0:
[junit] 8->10: forks[i] = 0 at f0:28.30-42 "forks[i] = 0";
[junit] 10->6: i = (i+1) at f0:28.25-28 "i++";
[junit] --> State 3
[junit]
[junit] Transition 4: State 3, proc 0:
[junit] 6->8: LOOP_TRUE_BRANCH at f0:28.18-23 "i < n";
[junit] --> State 4
[junit]
[junit] Transition 5: State 4, proc 0:
[junit] 8->10: forks[i] = 0 at f0:28.30-42 "forks[i] = 0";
[junit] 10->6: i = (i+1) at f0:28.25-28 "i++";
[junit] --> State 5
[junit]
[junit] Transition 6: State 5, proc 0:
[junit] 6->11: LOOP_FALSE_BRANCH at f0:28.18-23 "i < n";
[junit] 11->12: i = 0 at f0:29.7-16 "int i = 0";
[junit] --> State 7
[junit]
[junit] Transition 7: State 7, proc 0:
[junit] 12->14: LOOP_TRUE_BRANCH at f0:29.18-23 "i < n";
[junit] 14->16: $spawn dine(i) at f0:29.30-44 "$spawn dine(i)";
[junit] 16->12: i = (i+1) at f0:29.25-28 "i++";
[junit] --> State 8
[junit]
[junit] Transition 8: State 8, proc 0:
[junit] 12->14: LOOP_TRUE_BRANCH at f0:29.18-23 "i < n";
[junit] 14->16: $spawn dine(i) at f0:29.30-44 "$spawn dine(i)";
[junit] 16->12: i = (i+1) at f0:29.25-28 "i++";
[junit] --> State 9
[junit]
[junit] Transition 9: State 9, proc 0:
[junit] 12->17: LOOP_FALSE_BRANCH at f0:29.18-23 "i < n";
[junit] 17->RET: return (_CIVL_system) at f0:30.0-1 "}";
[junit] --> State 10
[junit]
[junit] Transition 10: State 10, proc 1:
[junit] 18->19: left = id at f0:16.2-15 "int left = id";
[junit] 19->20: right = ((id+1)%n) at f0:17.2-26 "int right = (id ... n";
[junit] --> State 11
[junit]
[junit] Transition 11: State 11, proc 1:
[junit] 20->23: LOOP_TRUE_BRANCH at f0:19.9-10 "1";
[junit] --> State 12
[junit]
[junit] Transition 12: State 12, proc 2:
[junit] 18->19: left = id at f0:16.2-15 "int left = id";
[junit] 19->20: right = ((id+1)%n) at f0:17.2-26 "int right = (id ... n";
[junit] --> State 13
[junit]
[junit] Transition 13: State 13, proc 2:
[junit] 20->23: LOOP_TRUE_BRANCH at f0:19.9-10 "1";
[junit] --> State 14
[junit]
[junit] Transition 14: State 14, proc 1:
[junit] 23->25: forks[left] = 1 at f0:20.29-44 "forks[left] = 1";
[junit] --> State 15
[junit]
[junit] Transition 15: State 15, proc 2:
[junit] 23->25: forks[left] = 1 at f0:20.29-44 "forks[left] = 1";
[junit] --> State 16
[junit]
[junit] State 16
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | n = 2
[junit] | | | | forks = X_s0v4[0:=1, 1:=1]
[junit] | | dyscope 1 (parent=2, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 0
[junit] | | | | right = 1
[junit] | | dyscope 2 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | left = 1
[junit] | | | | right = 0
[junit] | | dyscope 4 (parent=0, static=1)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=dine, location=25, f0:21.30-42 "forks[right]", scope=3]
[junit]
[junit] Violation of Deadlock found in State 16:
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 25, f0:21.30-42 "forks[right]"
[junit] Enabling predicate: false
[junit]
[junit] Trace ends after 15 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 95339
[junit] proverCalls : 131
[junit] memory (bytes) : 750256128
[junit] time (s) : 3.91
[junit] statesInstantiated : 108
[junit] statesSaved : 17
[junit] maxProcs : 3
[junit]
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 97372
[junit] proverCalls : 131
[junit] memory (bytes) : 750256128
[junit] time (s) : 4.13
[junit] maxProcs : 3
[junit] statesInstantiated : 4196
[junit] statesSaved : 408
[junit] statesSeen : 408
[junit] statesMatched : 82
[junit] steps : 1220
[junit] transitions : 489
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 100173
[junit] proverCalls : 156
[junit] memory (bytes) : 750256128
[junit] time (s) : 4.41
[junit] maxProcs : 6
[junit] statesInstantiated : 4103
[junit] statesSaved : 777
[junit] statesSeen : 767
[junit] statesMatched : 72
[junit] steps : 1090
[junit] transitions : 838
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 100292
[junit] proverCalls : 156
[junit] memory (bytes) : 750256128
[junit] time (s) : 4.52
[junit] maxProcs : 3
[junit] statesInstantiated : 225
[junit] statesSaved : 31
[junit] statesSeen : 31
[junit] statesMatched : 0
[junit] steps : 66
[junit] transitions : 30
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 2, f1:4.1-6 "$wait"
[junit] Enabling predicate: false
[junit] at f1:4.1-6 "$wait".
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, f1:4.1-6 "$wait", scope=0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/waitSelf_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : waitSelf.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 100293
[junit] proverCalls : 156
[junit] memory (bytes) : 750256128
[junit] time (s) : 4.61
[junit] maxProcs : 0
[junit] statesInstantiated : 6
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 0
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/waitSelf_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 72:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 19, f1:44.26-31 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 46, f1:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 46, f1:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 46, f1:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 46, f1:25.30-31 ";"
[junit] Enabling predicate: false
[junit] at f1:44.26-31 "$wait".
[junit] State 74
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=1, 1:=1, 2:=1, 3:=1]
[junit] | | | | num_in_barrier = 1
[junit] | | | | counter = 4
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=3]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=5]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=4]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=7]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=6]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=9]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=8]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/barrierBad_0.trace
[junit] Restricting search depth to 71
[junit] Error 1 encountered at depth 70:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:236976
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=1, 2:=1, 3:=0]
[junit] | | | | num_in_barrier = 1
[junit] | | | | counter = 3
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=9, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 9 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=4]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=36, f1:21.2-4 "if", scope=6]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=8]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=7]
[junit]
[junit] Logging new entry 1, writing trace to CIVLREP/barrierBad_1.trace
[junit] Restricting search depth to 69
[junit] Error 2 encountered at depth 68:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:237021
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=1, 2:=0, 3:=0]
[junit] | | | | num_in_barrier = 0
[junit] | | | | counter = 3
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=9, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 9 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=4]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=33, f1:19.2-17 "in_barrier[tid]", scope=6]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=8]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (68) is less than length of old (70): replacing old with new...
[junit] Restricting search depth to 67
[junit] Error 3 encountered at depth 66:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:237070
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=1, 2:=0, 3:=0]
[junit] | | | | num_in_barrier = 0
[junit] | | | | counter = 2
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=9, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 9 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=4]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=8]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (66) is less than length of old (68): replacing old with new...
[junit] Restricting search depth to 65
[junit] Error 4 encountered at depth 64:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:237193
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=1, 2:=0, 3:=0]
[junit] | | | | num_in_barrier = 6
[junit] | | | | counter = 2
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=9, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 9 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=36, f1:21.2-4 "if", scope=4]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=45, f1:23.4-18 "num_in_barrier", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=8]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (64) is less than length of old (66): replacing old with new...
[junit] Restricting search depth to 63
[junit] Error 5 encountered at depth 62:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:238332
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=1, 2:=0, 3:=1]
[junit] | | | | num_in_barrier = 6
[junit] | | | | counter = 2
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 3
[junit] | | dyscope 7 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=36, f1:21.2-4 "if", scope=4]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=9]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=8]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (62) is less than length of old (64): replacing old with new...
[junit] Restricting search depth to 61
[junit] Error 6 encountered at depth 60:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:238742
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=1, 2:=1, 3:=1]
[junit] | | | | num_in_barrier = 6
[junit] | | | | counter = 2
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 2
[junit] | | dyscope 7 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=36, f1:21.2-4 "if", scope=4]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=9]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=8]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (60) is less than length of old (62): replacing old with new...
[junit] Restricting search depth to 59
[junit] Error 7 encountered at depth 58:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:239421
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=0, 2:=1, 3:=1]
[junit] | | | | num_in_barrier = 5
[junit] | | | | counter = 2
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 2
[junit] | | dyscope 7 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=33, f1:19.2-17 "in_barrier[tid]", scope=4]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=9]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=8]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (58) is less than length of old (60): replacing old with new...
[junit] Restricting search depth to 57
[junit] Error 8 encountered at depth 56:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:240386
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=0, 2:=1, 3:=1]
[junit] | | | | num_in_barrier = 5
[junit] | | | | counter = 1
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 2
[junit] | | dyscope 7 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=4]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=9]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=8]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (56) is less than length of old (58): replacing old with new...
[junit] Restricting search depth to 55
[junit] Error 9 encountered at depth 54:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:240530
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 4
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>, 3:=process<4>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=1, 2:=1, 3:=1]
[junit] | | | | num_in_barrier = 5
[junit] | | | | counter = 1
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 7 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 8 (parent=0, static=5)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=9)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=0, static=4)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 3
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=4]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=9]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=8]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (54) is less than length of old (56): replacing old with new...
[junit] Restricting search depth to 53
[junit] Error 10 encountered at depth 52:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:304369
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=0, 2:=0]
[junit] | | | | num_in_barrier = 0
[junit] | | | | counter = 2
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 7 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=33, f1:19.2-17 "in_barrier[tid]", scope=4]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (52) is less than length of old (54): replacing old with new...
[junit] Restricting search depth to 51
[junit] Error 11 encountered at depth 50:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:304418
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=0, 2:=0]
[junit] | | | | num_in_barrier = 0
[junit] | | | | counter = 1
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 7 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=4]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=6]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (50) is less than length of old (52): replacing old with new...
[junit] Restricting search depth to 49
[junit] Error 12 encountered at depth 47:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:304838
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=0, 2:=1]
[junit] | | | | num_in_barrier = 4
[junit] | | | | counter = 1
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=5, static=9)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 2
[junit] | | dyscope 5 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 8 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=4]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=7]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=6]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (47) is less than length of old (50): replacing old with new...
[junit] Restricting search depth to 46
[junit] Error 13 encountered at depth 45:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((counter==N))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:34.4-11 "$assert".
[junit] State -1:304961
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 3
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>, 2:=process<3>]
[junit] | | | | in_barrier = X_s0v5[0:=0, 1:=1, 2:=1]
[junit] | | | | num_in_barrier = 4
[junit] | | | | counter = 1
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=5, static=9)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 5 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=0, static=5)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 8 (parent=0, static=4)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run, location=60, f1:34.4-11 "$assert", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=4]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=3]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=41, f1:22.28-41 "in_barrier[i]", scope=7]
[junit] | | | | Frame[function=run, location=54, f1:31.4-11 "barrier", scope=6]
[junit]
[junit] New log entry is equivalent to previously encountered entry 1
[junit] Length of new trace (45) is less than length of old (47): replacing old with new...
[junit] Restricting search depth to 44
[junit] Error 14 encountered at depth 40:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 19, f1:44.26-31 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 46, f1:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 46, f1:25.30-31 ";"
[junit] Enabling predicate: false
[junit] at f1:44.26-31 "$wait".
[junit] State 13733
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 2
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>]
[junit] | | | | in_barrier = X_s0v5[0:=1, 1:=1]
[junit] | | | | num_in_barrier = 1
[junit] | | | | counter = 2
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=3]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=5]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=4]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (40) is less than length of old (72): replacing old with new...
[junit] Restricting search depth to 39
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 216259
[junit] proverCalls : 169
[junit] memory (bytes) : 699924480
[junit] time (s) : 6.69
[junit] maxProcs : 5
[junit] statesInstantiated : 126772
[junit] statesSaved : 13979
[junit] statesSeen : 13976
[junit] statesMatched : 13823
[junit] steps : 39706
[junit] transitions : 27798
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/barrierBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = NULL
[junit] | | | | N = NULL
[junit] | | | | threads = NULL
[junit] | | | | in_barrier = NULL
[junit] | | | | num_in_barrier = NULL
[junit] | | | | counter = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, f1:6.0-6 "$input", scope=0]
[junit]
[junit]
[junit] Transition 1: State 0, proc 0:
[junit] 0->1: B = 4 at f1:6.0-12 "$input int B";
[junit] 1->2: N = InitialValue(N) at f1:7.0-12 "$input int N";
[junit] 2->3: $assume ((1<=N)&&(N<=B)) at f1:8.0-20 "$assume 1<=N && N ... B";
[junit] 3->4: threads = InitialValue(threads) at f1:9.0-16 "$proc threads[N]";
[junit] 4->5: in_barrier = InitialValue(in_barrier) at f1:10.0-17 "int in_barrier[N]";
[junit] 5->6: num_in_barrier = 0 at f1:11.0-22 "int num_in_barrier = 0";
[junit] 6->9: counter = 0 at f1:12.0-15 "int counter = 0";
[junit] 9->24: init() at f1:42.2-8 "init()";
[junit] --> State 1
[junit]
[junit] Transition 2: State 1, proc 0:
[junit] 24->25: i = 0 at f1:15.7-14 "int i=0";
[junit] --> State 2
[junit]
[junit] Transition 3: State 2, proc 0:
[junit] 25->27: LOOP_TRUE_BRANCH at f1:15.16-19 "i<N";
[junit] --> State 3
[junit]
[junit] Transition 4: State 3, proc 0:
[junit] 27->29: in_barrier[i] = 0 at f1:15.26-43 "in_barrier[i] = 0";
[junit] 29->25: i = (i+1) at f1:15.21-24 "i++";
[junit] --> State 4
[junit]
[junit] Transition 5: State 4, proc 0:
[junit] 25->27: LOOP_TRUE_BRANCH at f1:15.16-19 "i<N";
[junit] --> State 6
[junit]
[junit] Transition 6: State 6, proc 0:
[junit] 27->29: in_barrier[i] = 0 at f1:15.26-43 "in_barrier[i] = 0";
[junit] 29->25: i = (i+1) at f1:15.21-24 "i++";
[junit] --> State 7
[junit]
[junit] Transition 7: State 7, proc 0:
[junit] 25->30: LOOP_FALSE_BRANCH at f1:15.16-19 "i<N";
[junit] 30->RET: return (init) at f1:16.0-1 "}";
[junit] 10->11: i = 0 at f1:43.7-14 "int i=0";
[junit] --> State 9
[junit]
[junit] Transition 8: State 9, proc 0:
[junit] 11->13: LOOP_TRUE_BRANCH at f1:43.16-19 "i<N";
[junit] --> State 10
[junit]
[junit] Transition 9: State 10, proc 0:
[junit] 13->15: threads[i] = $spawn run(i) at f1:43.39-52 "$spawn run(i)";
[junit] 15->11: i = (i+1) at f1:43.21-24 "i++";
[junit] --> State 11
[junit]
[junit] Transition 10: State 11, proc 0:
[junit] 11->13: LOOP_TRUE_BRANCH at f1:43.16-19 "i<N";
[junit] --> State 12
[junit]
[junit] Transition 11: State 12, proc 0:
[junit] 13->15: threads[i] = $spawn run(i) at f1:43.39-52 "$spawn run(i)";
[junit] 15->11: i = (i+1) at f1:43.21-24 "i++";
[junit] --> State 13
[junit]
[junit] Transition 12: State 13, proc 0:
[junit] 11->16: LOOP_FALSE_BRANCH at f1:43.16-19 "i<N";
[junit] 16->17: i = 0 at f1:44.7-14 "int i=0";
[junit] --> State 14
[junit]
[junit] Transition 13: State 14, proc 0:
[junit] 17->19: LOOP_TRUE_BRANCH at f1:44.16-19 "i<N";
[junit] --> State 15
[junit]
[junit] Transition 14: State 15, proc 1:
[junit] 49->52: LOOP_TRUE_BRANCH at f1:29.9-14 "$true";
[junit] --> State 16
[junit]
[junit] Transition 15: State 16, proc 2:
[junit] 49->52: LOOP_TRUE_BRANCH at f1:29.9-14 "$true";
[junit] --> State 17
[junit]
[junit] Transition 16: State 17, proc 1:
[junit] 52->54: $assert((counter==0)) at f1:30.4-11 "$assert";
[junit] 54->33: barrier(tid) at f1:31.4-16 "barrier(tid)";
[junit] --> State 18
[junit]
[junit] Transition 17: State 18, proc 1:
[junit] 33->35: in_barrier[tid] = 1 at f1:19.2-21 "in_barrier[tid] = 1";
[junit] --> State 19
[junit]
[junit] Transition 18: State 19, proc 1:
[junit] 35->36: num_in_barrier = (num_in_barrier+1) at f1:20.2-18 "num_in_barrier++";
[junit] --> State 20
[junit]
[junit] Transition 19: State 20, proc 1:
[junit] 36->46: ELSE_BRANCH at f1:24.2-3 "}";
[junit] --> State 21
[junit]
[junit] Transition 20: State 21, proc 2:
[junit] 52->54: $assert((counter==0)) at f1:30.4-11 "$assert";
[junit] 54->33: barrier(tid) at f1:31.4-16 "barrier(tid)";
[junit] --> State 22
[junit]
[junit] Transition 21: State 22, proc 2:
[junit] 33->35: in_barrier[tid] = 1 at f1:19.2-21 "in_barrier[tid] = 1";
[junit] --> State 23
[junit]
[junit] Transition 22: State 23, proc 2:
[junit] 35->36: num_in_barrier = (num_in_barrier+1) at f1:20.2-18 "num_in_barrier++";
[junit] --> State 24
[junit]
[junit] Transition 23: State 24, proc 2:
[junit] 36->38: IF_BRANCH at f1:21.27-28 "{";
[junit] 38->39: i = 0 at f1:22.9-16 "int i=0";
[junit] --> State 25
[junit]
[junit] Transition 24: State 25, proc 2:
[junit] 39->41: LOOP_TRUE_BRANCH at f1:22.18-21 "i<N";
[junit] --> State 26
[junit]
[junit] Transition 25: State 26, proc 2:
[junit] 41->43: in_barrier[i] = 0 at f1:22.28-45 "in_barrier[i] = 0";
[junit] 43->39: i = (i+1) at f1:22.23-26 "i++";
[junit] --> State 27
[junit]
[junit] Transition 26: State 27, proc 2:
[junit] 39->41: LOOP_TRUE_BRANCH at f1:22.18-21 "i<N";
[junit] --> State 28
[junit]
[junit] Transition 27: State 28, proc 1:
[junit] 46->47: NO_OP at f1:25.30-31 ";";
[junit] 47->RET: return (barrier) at f1:26.0-1 "}";
[junit] --> State 29
[junit]
[junit] Transition 28: State 29, proc 1:
[junit] 56->58: counter = (counter+1) at f1:32.4-13 "counter++";
[junit] 58->33: barrier(tid) at f1:33.4-16 "barrier(tid)";
[junit] --> State 30
[junit]
[junit] Transition 29: State 30, proc 1:
[junit] 33->35: in_barrier[tid] = 1 at f1:19.2-21 "in_barrier[tid] = 1";
[junit] --> State 31
[junit]
[junit] Transition 30: State 31, proc 1:
[junit] 35->36: num_in_barrier = (num_in_barrier+1) at f1:20.2-18 "num_in_barrier++";
[junit] --> State 32
[junit]
[junit] Transition 31: State 32, proc 1:
[junit] 36->46: ELSE_BRANCH at f1:24.2-3 "}";
[junit] --> State 33
[junit]
[junit] Transition 32: State 33, proc 2:
[junit] 41->43: in_barrier[i] = 0 at f1:22.28-45 "in_barrier[i] = 0";
[junit] 43->39: i = (i+1) at f1:22.23-26 "i++";
[junit] --> State 34
[junit]
[junit] Transition 33: State 34, proc 2:
[junit] 39->45: LOOP_FALSE_BRANCH at f1:22.18-21 "i<N";
[junit] --> State 35
[junit]
[junit] Transition 34: State 35, proc 2:
[junit] 45->46: num_in_barrier = 0 at f1:23.4-22 "num_in_barrier = 0";
[junit] --> State 36
[junit]
[junit] Transition 35: State 36, proc 2:
[junit] 46->47: NO_OP at f1:25.30-31 ";";
[junit] 47->RET: return (barrier) at f1:26.0-1 "}";
[junit] --> State 37
[junit]
[junit] Transition 36: State 37, proc 2:
[junit] 56->58: counter = (counter+1) at f1:32.4-13 "counter++";
[junit] 58->33: barrier(tid) at f1:33.4-16 "barrier(tid)";
[junit] --> State 38
[junit]
[junit] Transition 37: State 38, proc 2:
[junit] 33->35: in_barrier[tid] = 1 at f1:19.2-21 "in_barrier[tid] = 1";
[junit] --> State 39
[junit]
[junit] Transition 38: State 39, proc 2:
[junit] 35->36: num_in_barrier = (num_in_barrier+1) at f1:20.2-18 "num_in_barrier++";
[junit] --> State 40
[junit]
[junit] Transition 39: State 40, proc 2:
[junit] 36->46: ELSE_BRANCH at f1:24.2-3 "}";
[junit] --> State 41
[junit]
[junit] State 41
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 4
[junit] | | | | N = 2
[junit] | | | | threads = X_s0v4[0:=process<1>, 1:=process<2>]
[junit] | | | | in_barrier = X_s0v5[0:=1, 1:=1]
[junit] | | | | num_in_barrier = 1
[junit] | | | | counter = 2
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=4)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=0, static=5)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=19, f1:44.26-31 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=3]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=barrier, location=46, f1:25.30-31 ";", scope=5]
[junit] | | | | Frame[function=run, location=58, f1:33.4-11 "barrier", scope=4]
[junit]
[junit] Violation of Deadlock found in State 41:
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 19, f1:44.26-31 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 46, f1:25.30-31 ";"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 46, f1:25.30-31 ";"
[junit] Enabling predicate: false
[junit]
[junit] Trace ends after 39 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 216471
[junit] proverCalls : 176
[junit] memory (bytes) : 699924480
[junit] time (s) : 6.8
[junit] statesInstantiated : 227
[junit] statesSaved : 42
[junit] maxProcs : 3
[junit]
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 54:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at f1:47.4-9 "$wait".
[junit] State 60
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 6
[junit] | | | | P = 3
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[5]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1,2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<-1>, 1:=process<1>, 2:=process<2>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[1]+X_s0v6[0]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1,2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 2
[junit] | | | | stop = 4
[junit] | | | | localSum = X_s0v6[2]+X_s0v6[3]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=13)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 4
[junit] | | | | stop = 6
[junit] | | | | localSum = X_s0v6[4]+X_s0v6[5]
[junit] | | dyscope 8 (parent=3, static=9)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=7]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/blockAdderBad_0.trace
[junit] Restricting search depth to 53
[junit] Error 1 encountered at depth 52:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] ProcessState 3: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at f1:47.4-9 "$wait".
[junit] State 62
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,3}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 6
[junit] | | | | P = 3
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[5]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1,3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<1>, 1:=process<2>, 2:=process<3>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[2]+X_s0v6[3]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1,3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 2
[junit] | | | | localSum = X_s0v6[1]+X_s0v6[0]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 7 (parent=8, static=13)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 4
[junit] | | | | stop = 6
[junit] | | | | localSum = X_s0v6[4]+X_s0v6[5]
[junit] | | dyscope 8 (parent=3, static=9)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | id = 2
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=7]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (52) is less than length of old (54): replacing old with new...
[junit] Restricting search depth to 51
[junit] Error 2 encountered at depth 48:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at f1:47.4-9 "$wait".
[junit] State 91
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 6
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[5]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<-1>, 1:=process<1>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[1]+X_s0v6[2]+X_s0v6[0]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 3
[junit] | | | | stop = 6
[junit] | | | | localSum = X_s0v6[3]+X_s0v6[4]+X_s0v6[5]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (48) is less than length of old (52): replacing old with new...
[junit] Restricting search depth to 47
[junit] Error 3 encountered at depth 46:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at f1:47.4-9 "$wait".
[junit] State 93
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 6
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[5]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<1>, 1:=process<2>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[3]+X_s0v6[4]+X_s0v6[5]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 3
[junit] | | | | localSum = X_s0v6[1]+X_s0v6[2]+X_s0v6[0]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (46) is less than length of old (48): replacing old with new...
[junit] Restricting search depth to 45
[junit] Error 4 encountered at depth 44:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at f1:47.4-9 "$wait".
[junit] State 179
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 5
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<-1>, 1:=process<1>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[1]+X_s0v6[0]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 2
[junit] | | | | stop = 5
[junit] | | | | localSum = X_s0v6[2]+X_s0v6[3]+X_s0v6[4]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (44) is less than length of old (46): replacing old with new...
[junit] Restricting search depth to 43
[junit] Error 5 encountered at depth 42:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at f1:47.4-9 "$wait".
[junit] State 181
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 5
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[4]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<1>, 1:=process<2>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[2]+X_s0v6[3]+X_s0v6[4]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 2
[junit] | | | | localSum = X_s0v6[1]+X_s0v6[0]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (42) is less than length of old (44): replacing old with new...
[junit] Restricting search depth to 41
[junit] Error 6 encountered at depth 40:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at f1:47.4-9 "$wait".
[junit] State 261
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 4
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<-1>, 1:=process<1>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[1]+X_s0v6[0]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 2
[junit] | | | | stop = 4
[junit] | | | | localSum = X_s0v6[2]+X_s0v6[3]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (40) is less than length of old (42): replacing old with new...
[junit] Restricting search depth to 39
[junit] Error 7 encountered at depth 38:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at f1:47.4-9 "$wait".
[junit] State 263
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 4
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[3]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<1>, 1:=process<2>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[2]+X_s0v6[3]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 2
[junit] | | | | localSum = X_s0v6[1]+X_s0v6[0]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (38) is less than length of old (40): replacing old with new...
[junit] Restricting search depth to 37
[junit] Error 8 encountered at depth 36:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at f1:47.4-9 "$wait".
[junit] State 337
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 3
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<-1>, 1:=process<1>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[0]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 1
[junit] | | | | stop = 3
[junit] | | | | localSum = X_s0v6[1]+X_s0v6[2]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (36) is less than length of old (38): replacing old with new...
[junit] Restricting search depth to 35
[junit] Error 9 encountered at depth 34:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at f1:47.4-9 "$wait".
[junit] State 339
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 3
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[2]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<1>, 1:=process<2>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[1]+X_s0v6[2]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 1
[junit] | | | | localSum = X_s0v6[0]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (34) is less than length of old (36): replacing old with new...
[junit] Restricting search depth to 33
[junit] Error 10 encountered at depth 32:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at f1:47.4-9 "$wait".
[junit] State 407
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 2
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<-1>, 1:=process<1>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[0]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 1
[junit] | | | | stop = 2
[junit] | | | | localSum = X_s0v6[1]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (32) is less than length of old (34): replacing old with new...
[junit] Restricting search depth to 31
[junit] Error 11 encountered at depth 30:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at f1:47.4-9 "$wait".
[junit] State 409
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 2
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[1]+X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<1>, 1:=process<2>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[1]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 1
[junit] | | | | localSum = X_s0v6[0]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (30) is less than length of old (32): replacing old with new...
[junit] Restricting search depth to 29
[junit] Error 12 encountered at depth 28:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] at f1:47.4-9 "$wait".
[junit] State 471
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 1
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<-1>, 1:=process<1>]
[junit] | | | | lock = 1
[junit] | | | | result = 0
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 1
[junit] | | | | localSum = X_s0v6[0]
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (28) is less than length of old (30): replacing old with new...
[junit] Restricting search depth to 27
[junit] Error 13 encountered at depth 26:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at f1:47.4-9 "$wait".
[junit] State 473
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 1
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<1>, 1:=process<2>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[0]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 0
[junit] | | | | localSum = 0
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (26) is less than length of old (28): replacing old with new...
[junit] Restricting search depth to 25
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 218474
[junit] proverCalls : 266
[junit] memory (bytes) : 699924480
[junit] time (s) : 7.12
[junit] maxProcs : 4
[junit] statesInstantiated : 2879
[junit] statesSaved : 489
[junit] statesSeen : 455
[junit] statesMatched : 0
[junit] steps : 786
[junit] transitions : 454
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/blockAdderBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Initial state:
[junit]
[junit] State 0
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = NULL
[junit] | | | | W = NULL
[junit] | | | | N = NULL
[junit] | | | | P = NULL
[junit] | | | | a = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=0, f1:9.0-6 "$input", scope=0]
[junit]
[junit]
[junit] Transition 1: State 0, proc 0:
[junit] 0->1: B = 6 at f1:9.0-12 "$input int B";
[junit] 1->2: W = 3 at f1:10.0-12 "$input int W";
[junit] 2->3: N = InitialValue(N) at f1:12.0-12 "$input int N";
[junit] 3->4: $assume ((1<=N)&&(N<=B)) at f1:13.0-20 "$assume N>=1 && N ... B";
[junit] 4->5: P = InitialValue(P) at f1:14.0-12 "$input int P";
[junit] 5->6: $assume ((1<=P)&&(P<=W)) at f1:15.0-20 "$assume P>=1 && P ... W";
[junit] 6->9: a = InitialValue(a) at f1:16.0-18 "$input double a[N]";
[junit] 9->15: sum_seq = adder_seq() at f1:52.19-30 "adder_seq()";
[junit] --> State 1
[junit]
[junit] Transition 2: State 1, proc 0:
[junit] 15->16: s = 0.0 at f1:19.2-16 "double s = 0.0";
[junit] 16->17: i = 0 at f1:21.7-14 "int i=0";
[junit] --> State 2
[junit]
[junit] Transition 3: State 2, proc 0:
[junit] 17->19: LOOP_TRUE_BRANCH at f1:21.16-19 "i<N";
[junit] --> State 3
[junit]
[junit] Transition 4: State 3, proc 0:
[junit] 19->21: s = (s+a[i]) at f1:22.4-13 "s += a[i]";
[junit] 21->17: i = (i+1) at f1:21.21-24 "i++";
[junit] --> State 4
[junit]
[junit] Transition 5: State 4, proc 0:
[junit] 17->22: LOOP_FALSE_BRANCH at f1:21.16-19 "i<N";
[junit] 22->RET: return s (adder_seq) at f1:23.2-11 "return s;";
[junit] 11->23: sum_par = adder_par() at f1:53.19-30 "adder_par()";
[junit] --> State 6
[junit]
[junit] Transition 6: State 6, proc 0:
[junit] 23->24: workers = InitialValue(workers) at f1:27.2-18 "$proc workers[P]";
[junit] 24->25: lock = 0 at f1:28.2-14 "int lock = 0";
[junit] 25->26: result = 0.0 at f1:29.2-21 "double result = 0.0";
[junit] 26->27: i = 0 at f1:43.7-14 "int i=0";
[junit] --> State 7
[junit]
[junit] Transition 7: State 7, proc 0:
[junit] 27->30: LOOP_TRUE_BRANCH at f1:43.16-19 "i<P";
[junit] --> State 8
[junit]
[junit] Transition 8: State 8, proc 0:
[junit] 30->27: i = (i+1) at f1:43.21-24 "i++";
[junit] --> State 9
[junit]
[junit] Transition 9: State 9, proc 0:
[junit] 27->30: LOOP_TRUE_BRANCH at f1:43.16-19 "i<P";
[junit] --> State 11
[junit]
[junit] Transition 10: State 11, proc 0:
[junit] 30->27: i = (i+1) at f1:43.21-24 "i++";
[junit] --> State 12
[junit]
[junit] Transition 11: State 12, proc 0:
[junit] 27->31: LOOP_FALSE_BRANCH at f1:43.16-19 "i<P";
[junit] 31->32: i = 0 at f1:44.7-14 "int i=0";
[junit] --> State 14
[junit]
[junit] Transition 12: State 14, proc 0:
[junit] 32->34: LOOP_TRUE_BRANCH at f1:44.16-19 "i<P";
[junit] --> State 15
[junit]
[junit] Transition 13: State 15, proc 0:
[junit] 34->36: workers[i] = $spawn run_worker(i) at f1:45.17-37 "$spawn run_worker(i)";
[junit] 36->32: i = (i+1) at f1:44.21-24 "i++";
[junit] --> State 16
[junit]
[junit] Transition 14: State 16, proc 0:
[junit] 32->34: LOOP_TRUE_BRANCH at f1:44.16-19 "i<P";
[junit] --> State 17
[junit]
[junit] Transition 15: State 17, proc 0:
[junit] 34->36: workers[i] = $spawn run_worker(i) at f1:45.17-37 "$spawn run_worker(i)";
[junit] 36->32: i = (i+1) at f1:44.21-24 "i++";
[junit] --> State 18
[junit]
[junit] Transition 16: State 18, proc 0:
[junit] 32->37: LOOP_FALSE_BRANCH at f1:44.16-19 "i<P";
[junit] 37->38: i = 0 at f1:46.7-14 "int i=0";
[junit] --> State 19
[junit]
[junit] Transition 17: State 19, proc 0:
[junit] 38->40: LOOP_TRUE_BRANCH at f1:46.16-19 "i<P";
[junit] --> State 20
[junit]
[junit] Transition 18: State 20, proc 1:
[junit] 44->45: start = ((id*N)/P) at f1:32.4-24 "int start = (id* ... P";
[junit] 45->46: stop = (((id+1)*N)/P) at f1:33.4-27 "int stop = ((id ... P";
[junit] 46->47: localSum = 0.0 at f1:34.4-25 "double localSum = 0.0";
[junit] 47->48: i = start at f1:36.9-20 "int i=start";
[junit] --> State 21
[junit]
[junit] Transition 19: State 21, proc 1:
[junit] 48->54: LOOP_FALSE_BRANCH at f1:36.22-28 "i<stop";
[junit] --> State 22
[junit]
[junit] Transition 20: State 22, proc 2:
[junit] 44->45: start = ((id*N)/P) at f1:32.4-24 "int start = (id* ... P";
[junit] 45->46: stop = (((id+1)*N)/P) at f1:33.4-27 "int stop = ((id ... P";
[junit] 46->47: localSum = 0.0 at f1:34.4-25 "double localSum = 0.0";
[junit] 47->48: i = start at f1:36.9-20 "int i=start";
[junit] --> State 23
[junit]
[junit] Transition 21: State 23, proc 2:
[junit] 48->50: LOOP_TRUE_BRANCH at f1:36.22-28 "i<stop";
[junit] --> State 24
[junit]
[junit] Transition 22: State 24, proc 2:
[junit] 50->52: localSum = (localSum+a[i]) at f1:37.6-22 "localSum += a[i]";
[junit] 52->48: i = (i+1) at f1:36.30-33 "i++";
[junit] --> State 25
[junit]
[junit] Transition 23: State 25, proc 2:
[junit] 48->54: LOOP_FALSE_BRANCH at f1:36.22-28 "i<stop";
[junit] --> State 26
[junit]
[junit] Transition 24: State 26, proc 2:
[junit] 54->56: lock = 1 at f1:38.20-28 "lock = 1";
[junit] --> State 27
[junit]
[junit] Transition 25: State 27, proc 2:
[junit] 56->57: result = (result+localSum) at f1:39.4-22 "result += localSum";
[junit] 57->RET: return (run_worker) at f1:41.2-3 "}";
[junit] --> State 28
[junit]
[junit] State 28
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | B = 6
[junit] | | | | W = 3
[junit] | | | | N = 1
[junit] | | | | P = 2
[junit] | | | | a = X_s0v6
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | sum_seq = X_s0v6[0]
[junit] | | | | sum_par = NULL
[junit] | | dyscope 2 (parent=3, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 3 (parent=4, static=8)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | workers = X_s2v1[0:=process<1>, 1:=process<2>]
[junit] | | | | lock = 1
[junit] | | | | result = X_s0v6[0]
[junit] | | dyscope 4 (parent=0, static=4)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 5 (parent=6, static=13)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | start = 0
[junit] | | | | stop = 0
[junit] | | | | localSum = 0
[junit] | | dyscope 6 (parent=3, static=9)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | id = 0
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=adder_par, location=40, f1:47.4-9 "$wait", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:53.19-28 "adder_par", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=run_worker, location=54, f1:38.20-24 "lock", scope=5]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] Violation of Deadlock found in State 28:
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 40, f1:47.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 54, f1:38.20-24 "lock"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit]
[junit] Trace ends after 25 transitions.
[junit] Violation(s) found.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 218591
[junit] proverCalls : 279
[junit] memory (bytes) : 699924480
[junit] time (s) : 7.25
[junit] statesInstantiated : 193
[junit] statesSaved : 29
[junit] maxProcs : 3
[junit]
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 223090
[junit] proverCalls : 360
[junit] memory (bytes) : 699924480
[junit] time (s) : 7.56
[junit] maxProcs : 4
[junit] statesInstantiated : 7143
[junit] statesSaved : 928
[junit] statesSeen : 894
[junit] statesMatched : 108
[junit] steps : 2101
[junit] transitions : 1001
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 223479
[junit] proverCalls : 361
[junit] memory (bytes) : 699924480
[junit] time (s) : 7.79
[junit] maxProcs : 3
[junit] statesInstantiated : 1071
[junit] statesSaved : 212
[junit] statesSeen : 199
[junit] statesMatched : 7
[junit] steps : 261
[junit] transitions : 205
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 54:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 10, f1:32.2-7 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 21, f1:12.17-18 "y"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 36, f1:21.17-18 "x"
[junit] Enabling predicate: false
[junit] at f1:32.2-7 "$wait".
[junit] State 112
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | y = 1
[junit] | | dyscope 1 (parent=0, static=4)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | p = process<1>
[junit] | | | | q = process<2>
[junit] | | dyscope 2 (parent=3, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 9
[junit] | | dyscope 3 (parent=0, static=2)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | n = 10
[junit] | | | | __heap = NULL
[junit] | | dyscope 4 (parent=5, static=6)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 5 (parent=0, static=3)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | m = 10
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:32.2-7 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=f, location=21, f1:12.17-18 "y", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=g, location=36, f1:21.17-18 "x", scope=4]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/locksBad10_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : locksBad10.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 223700
[junit] proverCalls : 361
[junit] memory (bytes) : 678428672
[junit] time (s) : 7.91
[junit] maxProcs : 3
[junit] statesInstantiated : 525
[junit] statesSaved : 113
[junit] statesSeen : 113
[junit] statesMatched : 1
[junit] steps : 140
[junit] transitions : 113
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/locksBad10_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 6:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: terminated
[junit] ProcessState 1: at location 14, f0:10.19-24 "lock1"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 26, f0:19.19-24 "lock0"
[junit] Enabling predicate: false
[junit] at f0:10.19-24 "lock1".
[junit] State 8
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | lock0 = true
[junit] | | | | lock1 = true
[junit] | | dyscope 1 (parent=0, static=1)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 2 (parent=0, static=2)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=proc0, location=14, f0:10.19-24 "lock1", scope=1]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=proc1, location=26, f0:19.19-24 "lock0", scope=2]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/locksBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : locksBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 223721
[junit] proverCalls : 361
[junit] memory (bytes) : 678428672
[junit] time (s) : 7.91
[junit] maxProcs : 3
[junit] statesInstantiated : 53
[junit] statesSaved : 9
[junit] statesSeen : 9
[junit] statesMatched : 1
[junit] steps : 13
[junit] transitions : 9
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/locksBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error (kind: UNDEFINED_VALUE, certainty: PROVEABLE)
[junit] Attempt to read uninitialized variable
[junit] at f1:23.10-12 "s1".
[junit] State -1:326823
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | N = 10
[junit] | | | | s1 = NULL
[junit] | | | | s2 = NULL
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | p = process<1>
[junit] | | | | q = process<2>
[junit] | | dyscope 2 (parent=0, static=3)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | n = 10
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=0, static=4)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | n = 10
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=7, f1:23.2-9 "$assert", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=f1, location=15, f1:10.2-4 "s1", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=f2, location=25, f1:15.2-4 "s2", scope=3]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/spawnBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : spawnBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 223727
[junit] proverCalls : 361
[junit] memory (bytes) : 678428672
[junit] time (s) : 8.01
[junit] maxProcs : 3
[junit] statesInstantiated : 23
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 1
[junit]
[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: 5.19 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 202984
[junit] proverCalls : 44
[junit] memory (bytes) : 562561024
[junit] time (s) : 4.8
[junit] maxProcs : 11
[junit] statesInstantiated : 239319
[junit] statesSaved : 13156
[junit] statesSeen : 13138
[junit] statesMatched : 11620
[junit] steps : 64719
[junit] transitions : 24757
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 212995
[junit] proverCalls : 44
[junit] memory (bytes) : 564133888
[junit] time (s) : 5.19
[junit] maxProcs : 5
[junit] statesInstantiated : 19344
[junit] statesSaved : 2335
[junit] statesSeen : 2335
[junit] statesMatched : 2579
[junit] steps : 5638
[junit] transitions : 4913
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.LanguageFeaturesTest
[junit] Tests run: 72, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 10.203 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 3:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((*((p+4))==3.14))
[junit] Path condition: 0 <= SIZEOF_REAL+-1
[junit] Assertion: 0 == -1*UNDEFINED[4]+157/50
[junit]
[junit] at f1:11.2-9 "$assert".
[junit] State -1:585507
[junit] | Path condition
[junit] | | 0 <= SIZEOF_REAL+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | dyscope 1 (parent=0, static=4)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = $heap<(real[1][])<UNDEFINED>>
[junit] | | | | p = pointer<scope<1>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=8, f1:11.2-9 "$assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/mallocBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : mallocBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 10
[junit] proverCalls : 2
[junit] memory (bytes) : 564133888
[junit] time (s) : 0.13
[junit] maxProcs : 1
[junit] statesInstantiated : 21
[junit] statesSaved : 4
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 2
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/mallocBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 19
[junit] proverCalls : 2
[junit] memory (bytes) : 564133888
[junit] time (s) : 0.22
[junit] maxProcs : 1
[junit] statesInstantiated : 28
[junit] statesSaved : 5
[junit] statesSeen : 5
[junit] statesMatched : 0
[junit] steps : 6
[junit] transitions : 4
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] Error: This feature is not yet implemented: Escape sequence
[junit] at f1:7.2-8 "printf".
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 56
[junit] proverCalls : 5
[junit] memory (bytes) : 564133888
[junit] time (s) : 0.52
[junit] maxProcs : 1
[junit] statesInstantiated : 93
[junit] statesSaved : 4
[junit] statesSeen : 3
[junit] statesMatched : 1
[junit] steps : 22
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 1
[junit] matchedMessage is __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 1
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 2
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 3
[junit] matchedMessage is __message__<2,3,0,inject(0,(int[1])<2>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 3
[junit] matchedMessage is __message__<2,3,0,inject(0,(int[1])<2>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 3
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 1
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 2
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 4
[junit] matchedMessage is __message__<3,4,0,inject(0,(int[1])<3>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 4
[junit] matchedMessage is __message__<3,4,0,inject(0,(int[1])<3>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 4
[junit] matchedMessage is __message__<3,4,0,inject(0,(int[1])<3>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 5
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 4
[junit] matchedMessage is __message__<3,4,0,inject(0,(int[1])<3>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 4
[junit] matchedMessage is __message__<3,4,0,inject(0,(int[1])<3>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 3
[junit] matchedMessage is __message__<2,3,0,inject(0,(int[1])<2>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 5
[junit] comm_place is 4
[junit] matchedMessage is __message__<3,4,0,inject(0,(int[1])<3>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 4
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 4
[junit] comm_place is 1
[junit] matchedMessage is __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 4
[junit] comm_place is 1
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 4
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 4
[junit] comm_place is 2
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 4
[junit] comm_place is 3
[junit] matchedMessage is __message__<2,3,0,inject(0,(int[1])<2>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 4
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is false
[junit] comm_size is 4
[junit] comm_place is 1
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is false
[junit] comm_size is 4
[junit] comm_place is 2
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 4
[junit] comm_place is 3
[junit] matchedMessage is __message__<2,3,0,inject(0,(int[1])<2>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 4
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 4
[junit] comm_place is 3
[junit] matchedMessage is __message__<2,3,0,inject(0,(int[1])<2>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 4
[junit] comm_place is 3
[junit] matchedMessage is __message__<2,3,0,inject(0,(int[1])<2>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 4
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 4
[junit] comm_place is 3
[junit] matchedMessage is __message__<2,3,0,inject(0,(int[1])<2>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 3
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 3
[junit] comm_place is 1
[junit] matchedMessage is __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 3
[junit] comm_place is 1
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is false
[junit] comm_size is 3
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is false
[junit] comm_size is 3
[junit] comm_place is 1
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 3
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 3
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 3
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 3
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 3
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 3
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 3
[junit] comm_place is 2
[junit] matchedMessage is __message__<1,2,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 2
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 2
[junit] comm_place is 1
[junit] matchedMessage is __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 2
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 2
[junit] comm_place is 1
[junit] matchedMessage is __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] hasMessage is false
[junit] comm_size is 2
[junit] comm_place is 0
[junit] matchedMessage is __message__<-1,-1,-1,X_s-1v-1,-1>
[junit] hasMessage is true
[junit] comm_size is 2
[junit] comm_place is 1
[junit] matchedMessage is __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 1
[junit] comm_place is 0
[junit] matchedMessage is __message__<0,0,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 1
[junit] comm_place is 0
[junit] matchedMessage is __message__<0,0,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] hasMessage is true
[junit] comm_size is 1
[junit] comm_place is 0
[junit] matchedMessage is __message__<0,0,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5716
[junit] proverCalls : 110
[junit] memory (bytes) : 564133888
[junit] time (s) : 1.27
[junit] maxProcs : 6
[junit] statesInstantiated : 8567
[junit] statesSaved : 1254
[junit] statesSeen : 1102
[junit] statesMatched : 0
[junit] steps : 2442
[junit] transitions : 1101
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5717
[junit] proverCalls : 110
[junit] memory (bytes) : 564133888
[junit] time (s) : 1.27
[junit] maxProcs : 1
[junit] statesInstantiated : 9
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5722
[junit] proverCalls : 110
[junit] memory (bytes) : 534249472
[junit] time (s) : 1.46
[junit] maxProcs : 1
[junit] statesInstantiated : 15
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5745
[junit] proverCalls : 110
[junit] memory (bytes) : 534249472
[junit] time (s) : 1.56
[junit] maxProcs : 1
[junit] statesInstantiated : 42
[junit] statesSaved : 9
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 11
[junit] transitions : 8
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5751
[junit] proverCalls : 111
[junit] memory (bytes) : 534249472
[junit] time (s) : 1.66
[junit] maxProcs : 1
[junit] statesInstantiated : 19
[junit] statesSaved : 5
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5760
[junit] proverCalls : 111
[junit] memory (bytes) : 534249472
[junit] time (s) : 1.76
[junit] maxProcs : 1
[junit] statesInstantiated : 16
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] a is abc
[junit] b is 9
[junit] a is not really a.
[junit] test[2] is 9
[junit] =================== Stats ===================
[junit] validCalls : 5777
[junit] proverCalls : 111
[junit] memory (bytes) : 534249472
[junit] time (s) : 1.86
[junit] maxProcs : 1
[junit] statesInstantiated : 58
[junit] statesSaved : 9
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 16
[junit] transitions : 8
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5789
[junit] proverCalls : 111
[junit] memory (bytes) : 534249472
[junit] time (s) : 1.96
[junit] maxProcs : 1
[junit] statesInstantiated : 29
[junit] statesSaved : 5
[junit] statesSeen : 4
[junit] statesMatched : 0
[junit] steps : 6
[junit] transitions : 3
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 5999
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.08
[junit] maxProcs : 1
[junit] statesInstantiated : 335
[junit] statesSaved : 62
[junit] statesSeen : 57
[junit] statesMatched : 0
[junit] steps : 101
[junit] transitions : 56
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((p!=($real*) 0))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:10.2-9 "$assert".
[junit] State -1:594742
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | p = pointer<scope<-1>,-1,Ref<0>>
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, f1:10.2-9 "$assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/assertNullPointer_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : assertNullPointer.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6005
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.18
[junit] maxProcs : 0
[junit] statesInstantiated : 10
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 2
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/assertNullPointer_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 9:
[junit] CIVL execution error (kind: DEREFERENCE, certainty: PROVEABLE)
[junit] Attempt to dereference pointer into scope which has been removed from state
[junit] at f1:23.2-5 "*gp".
[junit] State -1:594800
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | gp = pointer<scope<-1>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | | | gStart = true
[junit] | | dyscope 1 (parent=0, static=6)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | f = process<-1>
[junit] | | | | g = process<1>
[junit] | | dyscope 2 (parent=0, static=5)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=9, f1:31.2-7 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=goo, location=24, f1:23.2-5 "*gp", scope=2]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/removedHeapPointer_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : removedHeapPointer.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6027
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.28
[junit] maxProcs : 3
[junit] statesInstantiated : 58
[junit] statesSaved : 10
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 12
[junit] transitions : 8
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/removedHeapPointer_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] test0 aabb
[junit] test1 aa
[junit] bb aabb aa bb ' "
[junit] test2 58, 58, 58
[junit] test3 333333333/10000000,333333333/10000000,333333333/10000000,333333333/10000000
[junit] test4 33333/1000,33333/1000,33333/1000,33333/1000
[junit] test5 38,test%dString
[junit] test6 X_s0v2,X_s0v3,X_s0v4
[junit] test7 pointer<scope<0>,2,Ref<1>>
[junit] test8 X_s1v6[0]
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6056
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.38
[junit] maxProcs : 1
[junit] statesInstantiated : 92
[junit] statesSaved : 12
[junit] statesSeen : 12
[junit] statesMatched : 0
[junit] steps : 28
[junit] transitions : 11
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6070
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.49
[junit] maxProcs : 1
[junit] statesInstantiated : 34
[junit] statesSaved : 3
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6085
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.59
[junit] maxProcs : 1
[junit] statesInstantiated : 31
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6167
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.71
[junit] maxProcs : 1
[junit] statesInstantiated : 146
[junit] statesSaved : 16
[junit] statesSeen : 16
[junit] statesMatched : 1
[junit] steps : 43
[junit] transitions : 16
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6184
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.81
[junit] maxProcs : 1
[junit] statesInstantiated : 38
[junit] statesSaved : 6
[junit] statesSeen : 6
[junit] statesMatched : 0
[junit] steps : 10
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] 2 is smaller than 10!
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((a<b), &__anon_0[0], b, a)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:10.2-9 "$assert".
[junit] State -1:595158
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | a = 10
[junit] | | | | b = 2
[junit] | | | | __anon_0 = (CHAR[23])<'%','d',' ','i','s',' ','s','m','a','l','l','e','r',' ','t','h','a','n',' ','%','d','!',' '>
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=4, f1:10.2-9 "$assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/assertPrintf_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : assertPrintf.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6190
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.91
[junit] maxProcs : 1
[junit] statesInstantiated : 17
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/assertPrintf_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6196
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.91
[junit] maxProcs : 1
[junit] statesInstantiated : 17
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6285
[junit] proverCalls : 115
[junit] memory (bytes) : 534249472
[junit] time (s) : 2.92
[junit] maxProcs : 1
[junit] statesInstantiated : 164
[junit] statesSaved : 44
[junit] statesSeen : 44
[junit] statesMatched : 0
[junit] steps : 45
[junit] transitions : 43
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6336
[junit] proverCalls : 126
[junit] memory (bytes) : 534249472
[junit] time (s) : 4.81
[junit] maxProcs : 1
[junit] statesInstantiated : 90
[junit] statesSaved : 13
[junit] statesSeen : 13
[junit] statesMatched : 0
[junit] steps : 24
[junit] transitions : 12
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((y<x))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:10.2-8 "assert".
[junit] State -1:595444
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | y = 2
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=5, f1:10.2-8 "assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/cAssert_0.trace
[junit]
[junit] File name list:
[junit] f0 : assert.h
[junit] f1 : cAssert.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6343
[junit] proverCalls : 126
[junit] memory (bytes) : 534249472
[junit] time (s) : 4.82
[junit] maxProcs : 0
[junit] statesInstantiated : 15
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/cAssert_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6367
[junit] proverCalls : 129
[junit] memory (bytes) : 534249472
[junit] time (s) : 4.93
[junit] maxProcs : 1
[junit] statesInstantiated : 40
[junit] statesSaved : 7
[junit] statesSeen : 6
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6384
[junit] proverCalls : 129
[junit] memory (bytes) : 534249472
[junit] time (s) : 5.02
[junit] maxProcs : 1
[junit] statesInstantiated : 46
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 14
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6395
[junit] proverCalls : 132
[junit] memory (bytes) : 534249472
[junit] time (s) : 5.72
[junit] maxProcs : 1
[junit] statesInstantiated : 30
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6400
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 5.81
[junit] maxProcs : 1
[junit] statesInstantiated : 18
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6745
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 5.91
[junit] maxProcs : 5
[junit] statesInstantiated : 468
[junit] statesSaved : 79
[junit] statesSeen : 79
[junit] statesMatched : 0
[junit] steps : 159
[junit] transitions : 78
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6750
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.01
[junit] maxProcs : 2
[junit] statesInstantiated : 26
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6916
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.11
[junit] maxProcs : 1
[junit] statesInstantiated : 197
[junit] statesSaved : 31
[junit] statesSeen : 31
[junit] statesMatched : 0
[junit] steps : 59
[junit] transitions : 30
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6927
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.22
[junit] maxProcs : 1
[junit] statesInstantiated : 30
[junit] statesSaved : 7
[junit] statesSeen : 7
[junit] statesMatched : 0
[junit] steps : 7
[junit] transitions : 6
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6950
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.32
[junit] maxProcs : 1
[junit] statesInstantiated : 48
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 16
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 6957
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.42
[junit] maxProcs : 1
[junit] statesInstantiated : 20
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7125
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.52
[junit] maxProcs : 4
[junit] statesInstantiated : 308
[junit] statesSaved : 30
[junit] statesSeen : 30
[junit] statesMatched : 10
[junit] steps : 95
[junit] transitions : 39
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: UNDEFINED_VALUE, certainty: PROVEABLE)
[junit] Attempt to read uninitialized variable
[junit] at f1:10.2-3 "p".
[junit] State -1:596682
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | dyscope 1 (parent=0, static=3)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | p = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=2, f1:10.2-6 "p[4]", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/mallocBad2_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : mallocBad2.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7126
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.71
[junit] maxProcs : 0
[junit] statesInstantiated : 7
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/mallocBad2_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: UNDEFINED_VALUE, certainty: PROVEABLE)
[junit] Attempt to use undefined pointer
[junit] at f0:11.6-12 "n.next".
[junit] State -1:596691
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | dyscope 1 (parent=0, static=1)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | n = X_s1v1
[junit] | | | | x = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=1, f0:11.2-4 "if", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/undefPointer_0.trace
[junit]
[junit] File name list:
[junit] f0 : undefPointer.cvl
[junit] f1 : stddef.h
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7129
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.72
[junit] maxProcs : 0
[junit] statesInstantiated : 9
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/undefPointer_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7151
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.81
[junit] maxProcs : 1
[junit] statesInstantiated : 67
[junit] statesSaved : 15
[junit] statesSeen : 15
[junit] statesMatched : 0
[junit] steps : 17
[junit] transitions : 14
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7242
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.92
[junit] maxProcs : 4
[junit] statesInstantiated : 195
[junit] statesSaved : 29
[junit] statesSeen : 29
[junit] statesMatched : 0
[junit] steps : 55
[junit] transitions : 28
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: OTHER, certainty: CONCRETE)
[junit] Non-determinism is encountered in $atom block.
[junit] at f0:13.2-9 "$choose".
[junit] State -1:596970
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | n = 3
[junit] | | dyscope 1 (parent=0, static=1)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 2
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, f0:18.1-2 "}", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/atomChooseBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : atomChooseBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7249
[junit] proverCalls : 132
[junit] memory (bytes) : 517996544
[junit] time (s) : 6.92
[junit] maxProcs : 0
[junit] statesInstantiated : 20
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/atomChooseBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7265
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.02
[junit] maxProcs : 1
[junit] statesInstantiated : 42
[junit] statesSaved : 9
[junit] statesSeen : 8
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 7
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7487
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.12
[junit] maxProcs : 3
[junit] statesInstantiated : 163
[junit] statesSaved : 10
[junit] statesSeen : 10
[junit] statesMatched : 2
[junit] steps : 48
[junit] transitions : 11
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7498
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.22
[junit] maxProcs : 1
[junit] statesInstantiated : 32
[junit] statesSaved : 5
[junit] statesSeen : 5
[junit] statesMatched : 0
[junit] steps : 8
[junit] transitions : 4
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7505
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.29
[junit] maxProcs : 1
[junit] statesInstantiated : 23
[junit] statesSaved : 4
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7734
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.39
[junit] maxProcs : 1
[junit] statesInstantiated : 275
[junit] statesSaved : 39
[junit] statesSeen : 39
[junit] statesMatched : 0
[junit] steps : 99
[junit] transitions : 38
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 11:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 9, f1:20.2-7 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 25, f1:13.2-15 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] at f1:20.2-7 "$wait".
[junit] State 10
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,false>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>,(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>>>>>,(__comm__[0][])<>>
[junit] | | | | gcomm = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | | | start = true
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | worker_proc = process<1>
[junit] | | dyscope 2 (parent=3, static=10)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<0,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<2>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | dyscope 3 (parent=0, static=6)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | me = 0
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=9, f1:20.2-7 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=worker, location=25, f1:13.2-15 "$comm_dequeue", scope=2]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/commBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : commBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7759
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.5
[junit] maxProcs : 2
[junit] statesInstantiated : 63
[junit] statesSaved : 11
[junit] statesSeen : 11
[junit] statesMatched : 0
[junit] steps : 14
[junit] transitions : 10
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/commBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7768
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.6
[junit] maxProcs : 1
[junit] statesInstantiated : 17
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7874
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.69
[junit] maxProcs : 1
[junit] statesInstantiated : 233
[junit] statesSaved : 22
[junit] statesSeen : 22
[junit] statesMatched : 4
[junit] steps : 65
[junit] transitions : 25
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7875
[junit] proverCalls : 133
[junit] memory (bytes) : 517996544
[junit] time (s) : 7.7
[junit] maxProcs : 1
[junit] statesInstantiated : 9
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- 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] =================== Stats ===================
[junit] validCalls : 7885
[junit] proverCalls : 133
[junit] memory (bytes) : 503840768
[junit] time (s) : 7.88
[junit] maxProcs : 1
[junit] statesInstantiated : 43
[junit] statesSaved : 6
[junit] statesSeen : 6
[junit] statesMatched : 0
[junit] steps : 10
[junit] transitions : 5
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: UNDEFINED_VALUE, certainty: PROVEABLE)
[junit] Attempt to use undefined pointer
[junit] at f1:12.6-13 "n->next".
[junit] State 2
[junit] | Path condition
[junit] | | 0 <= SIZEOF(dynamicType<2315>)+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(node_t[1][])<H_p0s1v1i0l0>>
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | n = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | | | x = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, f1:12.2-4 "if", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/undefHeapPointer_0.trace
[junit]
[junit] File name list:
[junit] f0 : stdlib.h
[junit] f1 : undefHeapPointer.cvl
[junit] f2 : civlc.h
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7890
[junit] proverCalls : 134
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.04
[junit] maxProcs : 1
[junit] statesInstantiated : 13
[junit] statesSaved : 3
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/undefHeapPointer_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: OTHER, certainty: CONCRETE)
[junit] Blocked location is encountered in $atom block.
[junit] at f1:19.4-9 "$wait".
[junit] State -1:597894
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=5, f1:19.4-9 "$wait", scope=0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/atomWaitBad_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : atomWaitBad.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7894
[junit] proverCalls : 134
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.14
[junit] maxProcs : 0
[junit] statesInstantiated : 8
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 1
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/atomWaitBad_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 7900
[junit] proverCalls : 134
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.14
[junit] maxProcs : 1
[junit] statesInstantiated : 15
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 8142
[junit] proverCalls : 158
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.3
[junit] maxProcs : 1
[junit] statesInstantiated : 322
[junit] statesSaved : 69
[junit] statesSeen : 60
[junit] statesMatched : 0
[junit] steps : 87
[junit] transitions : 59
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 8187
[junit] proverCalls : 158
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.4
[junit] maxProcs : 1
[junit] statesInstantiated : 91
[junit] statesSaved : 15
[junit] statesSeen : 14
[junit] statesMatched : 0
[junit] steps : 24
[junit] transitions : 13
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 8219
[junit] proverCalls : 158
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.5
[junit] maxProcs : 1
[junit] statesInstantiated : 68
[junit] statesSaved : 13
[junit] statesSeen : 13
[junit] statesMatched : 0
[junit] steps : 18
[junit] transitions : 12
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] The char value is 'b'
[junit] =================== Stats ===================
[junit] validCalls : 8224
[junit] proverCalls : 158
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.59
[junit] maxProcs : 1
[junit] statesInstantiated : 22
[junit] statesSaved : 3
[junit] statesSeen : 3
[junit] statesMatched : 0
[junit] steps : 5
[junit] transitions : 2
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] I'm spawned with id 0.
[junit] I'm spawned with id 1.
[junit] I'm spawned with id 2.
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 1 terminates.
[junit] Process 1 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 2 terminates.
[junit] Process 2 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 1 terminates.
[junit] Process 1 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 1 terminates.
[junit] Process 1 now has invalid reference: process<-1>
[junit] I own scope with id scope<6>.
[junit] I own scope with id scope<4>.
[junit] Process 1 terminates.
[junit] Process 1 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<7>.
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<9>.
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<7>.
[junit] I own scope with id scope<9>.
[junit] I own scope with id scope<6>.
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<6>.
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<6>.
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<6>.
[junit] I own scope with id scope<9>.
[junit] I own scope with id scope<4>.
[junit] Process 0 terminates.
[junit] Process 0 now has invalid reference: process<-1>
[junit] I own scope with id scope<6>.
[junit] I own scope with id scope<9>.
[junit] I own scope with id scope<8>.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 9591
[junit] proverCalls : 158
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.83
[junit] maxProcs : 4
[junit] statesInstantiated : 1817
[junit] statesSaved : 257
[junit] statesSeen : 257
[junit] statesMatched : 53
[junit] steps : 518
[junit] transitions : 309
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 9667
[junit] proverCalls : 158
[junit] memory (bytes) : 503840768
[junit] time (s) : 8.92
[junit] maxProcs : 1
[junit] statesInstantiated : 123
[junit] statesSaved : 23
[junit] statesSeen : 22
[junit] statesMatched : 0
[junit] steps : 34
[junit] transitions : 21
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Message of size 2*SIZEOF_INT exceeds the specified size SIZEOF_INT.
[junit] Error 0 encountered at depth 10:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((message.4<=size), &__anon_0[0], message.4, size)
[junit] Path condition: 0 <= SIZEOF_INT+-1
[junit] Assertion: 0 <= -1*SIZEOF_INT
[junit]
[junit] at f0:141.2-9 "$assert".
[junit] State -1:600464
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(int[1][])<(int[2])<1,2>>>
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = (int[2])<1,2>
[junit] | | | | y = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | | | m = __message__<0,1,2,inject(3,(int[2])<1,2>),2*SIZEOF_INT>
[junit] | | dyscope 2 (parent=0, static=6)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | message = __message__<0,1,2,inject(3,(int[2])<1,2>),2*SIZEOF_INT>
[junit] | | | | buf = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | | | size = SIZEOF_INT
[junit] | | | | __heap = NULL
[junit] | | | | __anon_0 = (CHAR[50])<'M','e','s','s','a','g','e',' ','o','f',' ','s','i','z','e',' ','%','d',' ','e','x','c','e','e','d','s',' ','t','h','e',' ','s','p','e','c','i','f','i','e','d',' ','s','i','z','e',' ','%','d','.',' '>
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=$message_unpack, location=32, f0:141.2-9 "$assert", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=13, f1:11.2-17 "$message_unpack", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/messageUnpackBad1_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : messageUnpackBad1.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 9724
[junit] proverCalls : 159
[junit] memory (bytes) : 503840768
[junit] time (s) : 9.03
[junit] maxProcs : 1
[junit] statesInstantiated : 112
[junit] statesSaved : 12
[junit] statesSeen : 10
[junit] statesMatched : 0
[junit] steps : 29
[junit] transitions : 9
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/messageUnpackBad1_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 9:
[junit] CIVL execution error (kind: OUT_OF_BOUNDS, certainty: CONCRETE)
[junit] Attempt to write beyond array bound: index=1
[junit] at f0:140.2-35 "$bundle_unpack(message.data, buf)".
[junit] State -1:600575
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(int[1][])<(int[2])<1,2>>,(int[1][])<H_p0s1v1i1l0>>
[junit] | | dyscope 1 (parent=0, static=7)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = (int[2])<1,2>
[junit] | | | | y = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | | | z = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | m = __message__<0,1,2,inject(3,(int[2])<1,2>),2*SIZEOF_INT>
[junit] | | dyscope 2 (parent=0, static=6)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | message = __message__<0,1,2,inject(3,(int[2])<1,2>),2*SIZEOF_INT>
[junit] | | | | buf = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | size = SIZEOF_INT
[junit] | | | | __heap = NULL
[junit] | | | | __anon_0 = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=$message_unpack, location=31, f0:140.2-16 "$bundle_unpack", scope=2]
[junit] | | | | Frame[function=_CIVL_system, location=15, f1:12.2-17 "$message_unpack", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/messageUnpackBad2_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : messageUnpackBad2.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 9779
[junit] proverCalls : 159
[junit] memory (bytes) : 503840768
[junit] time (s) : 9.13
[junit] maxProcs : 1
[junit] statesInstantiated : 111
[junit] statesSaved : 11
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 28
[junit] transitions : 8
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/messageUnpackBad2_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] foo done.
[junit] goo done.
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 9859
[junit] proverCalls : 159
[junit] memory (bytes) : 503840768
[junit] time (s) : 9.33
[junit] maxProcs : 1
[junit] statesInstantiated : 174
[junit] statesSaved : 30
[junit] statesSeen : 30
[junit] statesMatched : 0
[junit] steps : 52
[junit] transitions : 29
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 10732
[junit] proverCalls : 159
[junit] memory (bytes) : 503840768
[junit] time (s) : 9.45
[junit] maxProcs : 6
[junit] statesInstantiated : 2195
[junit] statesSaved : 98
[junit] statesSeen : 98
[junit] statesMatched : 80
[junit] steps : 758
[junit] transitions : 177
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 10746
[junit] proverCalls : 159
[junit] memory (bytes) : 503840768
[junit] time (s) : 9.56
[junit] maxProcs : 1
[junit] statesInstantiated : 38
[junit] statesSaved : 3
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 9
[junit] transitions : 1
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 10810
[junit] proverCalls : 164
[junit] memory (bytes) : 503840768
[junit] time (s) : 9.68
[junit] maxProcs : 1
[junit] statesInstantiated : 128
[junit] statesSaved : 25
[junit] statesSeen : 24
[junit] statesMatched : 0
[junit] steps : 36
[junit] transitions : 23
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert(false)
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:4.2-9 "$assert".
[junit] State -1:603127
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=foo, location=6, f1:4.2-9 "$assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/spawnFoo_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : spawnFoo.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 10815
[junit] proverCalls : 164
[junit] memory (bytes) : 503840768
[junit] time (s) : 9.77
[junit] maxProcs : 2
[junit] statesInstantiated : 17
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 3
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/spawnFoo_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 12:
[junit] CIVL execution error (kind: OTHER, certainty: PROVEABLE)
[junit] sizeof element does not divide size argument
[junit] at f1:20.8-43 "$bundle_pack(&(s.a), ... )".
[junit] State -1:603202
[junit] | Path condition
[junit] | | 0 < SIZEOF_INT
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | dyscope 1 (parent=2, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 5
[junit] | | dyscope 2 (parent=0, static=4)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | c = X_s1v1
[junit] | | | | s = foo<(X_s1v2.0)[0:=0, 1:=1, 2:=4, 3:=9, 4:=16],25>
[junit] | | | | bun = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=12, f1:20.8-20 "$bundle_pack", scope=2]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/bundleStructComponent_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : bundleStructComponent.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 10851
[junit] proverCalls : 164
[junit] memory (bytes) : 503840768
[junit] time (s) : 9.87
[junit] maxProcs : 1
[junit] statesInstantiated : 75
[junit] statesSaved : 12
[junit] statesSeen : 12
[junit] statesMatched : 0
[junit] steps : 21
[junit] transitions : 11
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/bundleStructComponent_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 10904
[junit] proverCalls : 185
[junit] memory (bytes) : 503840768
[junit] time (s) : 10.02
[junit] maxProcs : 1
[junit] statesInstantiated : 71
[junit] statesSaved : 18
[junit] statesSeen : 13
[junit] statesMatched : 0
[junit] steps : 16
[junit] transitions : 12
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 1:
[junit] CIVL execution error (kind: DIVISION_BY_ZERO, certainty: PROVEABLE)
[junit] Division by zero
[junit] at f1:14.10-13 "x/y".
[junit] State -1:603285
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | x = X_s0v2
[junit] | | | | y = X_s0v3
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=3, f1:13.2-9 "$choose", scope=0]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/badGuard_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : badGuard.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 10908
[junit] proverCalls : 186
[junit] memory (bytes) : 503840768
[junit] time (s) : 10.11
[junit] maxProcs : 0
[junit] statesInstantiated : 12
[junit] statesSaved : 1
[junit] statesSeen : 1
[junit] statesMatched : 0
[junit] steps : 2
[junit] transitions : 0
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/badGuard_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 12662
[junit] proverCalls : 186
[junit] memory (bytes) : 503840768
[junit] time (s) : 10.21
[junit] maxProcs : 1
[junit] statesInstantiated : 2295
[junit] statesSaved : 443
[junit] statesSeen : 443
[junit] statesMatched : 0
[junit] steps : 775
[junit] transitions : 442
[junit]
[junit] The standard properties hold for all executions.
[junit] ------------- ---------------- ---------------
[junit] ------------- Standard Error -----------------
[junit] edu.udel.cis.vsl.abc.token.IF.SyntaxException: Syntax 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)" at functionPrototypeBad.cvl:8.6-9 "f()"
[junit] ------------- ---------------- ---------------
[junit] Testsuite: edu.udel.cis.vsl.civl.MessagePassingTest
[junit] Tests run: 8, Failures: 0, Errors: 0, Skipped: 1, Time elapsed: 5.916 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 196:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: 0 <= SIZEOF_INT+-1
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 54, f2:66.4-9 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 78, f3:39.26-31 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] ProcessState 3: at location 122, f4:49.16-29 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 122, f4:49.16-29 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] at f2:66.4-9 "$wait".
[junit] State 211
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,3,4}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>,(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>>>>>,(__comm__[0][])<>>
[junit] | | | | NPROCS = 2
[junit] | | | | __procs = X_s0v3[0:=process<1>, 1:=process<2>]
[junit] | | | | __start = true
[junit] | | | | __MPI_Comm_World = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | | | MPI_STATUS_IGNORE = pointer<scope<-1>,-1,Ref<0>>
[junit] | | dyscope 1 (parent=2, static=20)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=14)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | dyscope 3 (parent=4, static=27)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 4 (parent=5, static=21)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<0,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | rank = 0
[junit] | | | | tStart = true
[junit] | | | | MPI_COMM_WORLD = pointer<scope<4>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s3v4[0:=process<3>, 1:=process<4>]
[junit] | | dyscope 5 (parent=0, static=15)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | __rank = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=34)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 7 (parent=8, static=31)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 8 (parent=9, static=30)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | y = NULL
[junit] | | dyscope 9 (parent=4, static=25)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 10 (parent=11, static=29)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | in = X_s12v1
[junit] | | | | size = NULL
[junit] | | | | __anon_2 = NULL
[junit] | | dyscope 11 (parent=4, static=24)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | buf = pointer<scope<8>,2,Ref<1>>
[junit] | | | | count = 1
[junit] | | | | datatype = 1
[junit] | | | | source = 0
[junit] | | | | tag = 0
[junit] | | | | comm = pointer<scope<4>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | status = pointer<scope<-1>,-1,Ref<0>>
[junit] | | | | __heap = NULL
[junit] | | dyscope 12 (parent=13, static=34)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 13 (parent=14, static=31)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 14 (parent=15, static=30)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | y = NULL
[junit] | | dyscope 15 (parent=4, static=25)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 16 (parent=17, static=29)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | in = X_s18v1
[junit] | | | | size = NULL
[junit] | | | | __anon_2 = NULL
[junit] | | dyscope 17 (parent=4, static=24)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | buf = pointer<scope<14>,2,Ref<1>>
[junit] | | | | count = 1
[junit] | | | | datatype = 1
[junit] | | | | source = 0
[junit] | | | | tag = 0
[junit] | | | | comm = pointer<scope<4>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | status = pointer<scope<-1>,-1,Ref<0>>
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=finalize, location=54, f2:66.4-9 "$wait", scope=1]
[junit] | | | | Frame[function=_CIVL_system, location=10, f2:71.2-10 "finalize", scope=0]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=78, f3:39.26-31 "$wait", scope=3]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Recv, location=122, f4:49.16-29 "$comm_dequeue", scope=10]
[junit] | | | | Frame[function=Thread, location=184, f3:29.10-18 "MPI_Recv", scope=6]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Recv, location=122, f4:49.16-29 "$comm_dequeue", scope=16]
[junit] | | | | Frame[function=Thread, location=184, f3:29.10-18 "MPI_Recv", scope=12]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/hybrid_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : stdio.h
[junit] f2 : mp_root2.cvh
[junit] f3 : hybrid.cvl
[junit] f4 : mp_proc2.cvh
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 1821
[junit] proverCalls : 1
[junit] memory (bytes) : 493355008
[junit] time (s) : 0.31
[junit] maxProcs : 7
[junit] statesInstantiated : 1400
[junit] statesSaved : 212
[junit] statesSeen : 196
[junit] statesMatched : 0
[junit] steps : 382
[junit] transitions : 195
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/hybrid_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 44786
[junit] proverCalls : 218
[junit] memory (bytes) : 433586176
[junit] time (s) : 3.44
[junit] maxProcs : 6
[junit] statesInstantiated : 57664
[junit] statesSaved : 8670
[junit] statesSeen : 8005
[junit] statesMatched : 0
[junit] steps : 15836
[junit] transitions : 8004
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 113:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: 0 <= SIZEOF_INT+-1
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 12, f1:41.31-36 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 52, f1:33.33-38 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 52, f1:33.33-38 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 84, f1:26.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 84, f1:26.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 5: at location 77, f1:24.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] at f1:41.31-36 "$wait".
[junit] State 644
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4,5}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>,(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>>>>>,(__comm__[0][])<>>
[junit] | | | | gcomm = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | dyscope 1 (parent=2, static=14)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | procs = X_s4v1[0:=process<1>, 1:=process<2>]
[junit] | | dyscope 3 (parent=4, static=21)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 4 (parent=5, static=18)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<0,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<4>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s3v2[0:=process<3>, 1:=process<4>]
[junit] | | dyscope 5 (parent=0, static=11)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | rank = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=21)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 7 (parent=8, static=18)
[junit] | | | reachers = {2,5}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<1,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<7>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s6v2[0:=process<-1>, 1:=process<5>]
[junit] | | dyscope 8 (parent=0, static=11)
[junit] | | | reachers = {2,5}
[junit] | | | variables
[junit] | | | | rank = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=26)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=11, static=23)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 1
[junit] | | dyscope 11 (parent=12, static=22)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | in = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | | | out = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | dyscope 12 (parent=4, static=19)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 13 (parent=14, static=26)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 14 (parent=15, static=23)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 1
[junit] | | dyscope 15 (parent=16, static=22)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | in = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | | | out = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | dyscope 16 (parent=4, static=19)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 17 (parent=18, static=25)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 18 (parent=19, static=23)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 19 (parent=20, static=22)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | in = X_s21v2
[junit] | | | | out = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | dyscope 20 (parent=7, static=19)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=12, f1:41.31-36 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=52, f1:33.33-38 "$wait", scope=3]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=52, f1:33.33-38 "$wait", scope=6]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=84, f1:26.37-50 "$comm_dequeue", scope=9]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=84, f1:26.37-50 "$comm_dequeue", scope=13]
[junit] | | process 5
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=77, f1:24.37-50 "$comm_dequeue", scope=17]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/mpi-pthreads_0.trace
[junit] Restricting search depth to 112
[junit] Error 1 encountered at depth 109:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: 0 <= SIZEOF_INT+-1
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 12, f1:41.31-36 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 52, f1:33.33-38 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 52, f1:33.33-38 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 84, f1:26.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 84, f1:26.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 5: at location 77, f1:24.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 6: at location 77, f1:24.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] at f1:41.31-36 "$wait".
[junit] State 646
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4,5,6}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>,(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>>>>>,(__comm__[0][])<>>
[junit] | | | | gcomm = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | dyscope 1 (parent=2, static=14)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | procs = X_s4v1[0:=process<1>, 1:=process<2>]
[junit] | | dyscope 3 (parent=4, static=21)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 4 (parent=5, static=18)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<0,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<4>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s3v2[0:=process<3>, 1:=process<4>]
[junit] | | dyscope 5 (parent=0, static=11)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | rank = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=21)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 7 (parent=8, static=18)
[junit] | | | reachers = {2,5,6}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<1,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<7>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s6v2[0:=process<5>, 1:=process<6>]
[junit] | | dyscope 8 (parent=0, static=11)
[junit] | | | reachers = {2,5,6}
[junit] | | | variables
[junit] | | | | rank = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=26)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=11, static=23)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 1
[junit] | | dyscope 11 (parent=12, static=22)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | in = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | | | out = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | dyscope 12 (parent=4, static=19)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 13 (parent=14, static=26)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 14 (parent=15, static=23)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 1
[junit] | | dyscope 15 (parent=16, static=22)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | in = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | | | out = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | dyscope 16 (parent=4, static=19)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 17 (parent=18, static=25)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 18 (parent=19, static=23)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 1
[junit] | | dyscope 19 (parent=20, static=22)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | in = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | | | out = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | dyscope 20 (parent=7, static=19)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 21 (parent=22, static=25)
[junit] | | | reachers = {6}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 22 (parent=23, static=23)
[junit] | | | reachers = {6}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 23 (parent=24, static=22)
[junit] | | | reachers = {6}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | in = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | | | out = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | dyscope 24 (parent=7, static=19)
[junit] | | | reachers = {6}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=12, f1:41.31-36 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=52, f1:33.33-38 "$wait", scope=3]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=52, f1:33.33-38 "$wait", scope=6]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=84, f1:26.37-50 "$comm_dequeue", scope=9]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=84, f1:26.37-50 "$comm_dequeue", scope=13]
[junit] | | process 5
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=77, f1:24.37-50 "$comm_dequeue", scope=17]
[junit] | | process 6
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=77, f1:24.37-50 "$comm_dequeue", scope=21]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (109) is less than length of old (113): replacing old with new...
[junit] Restricting search depth to 108
[junit] Error 2 encountered at depth 83:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: 0 <= SIZEOF_INT+-1
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 12, f1:41.31-36 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 52, f1:33.33-38 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 52, f1:33.33-38 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 84, f1:26.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 84, f1:26.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 5: at location 77, f1:24.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 6: at location 77, f1:24.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] at f1:41.31-36 "$wait".
[junit] State 652
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4,5,6}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>,(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>>>>>,(__comm__[0][])<>>
[junit] | | | | gcomm = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | dyscope 1 (parent=2, static=14)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | procs = X_s4v1[0:=process<1>, 1:=process<2>]
[junit] | | dyscope 3 (parent=4, static=21)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 4 (parent=5, static=18)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<0,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<4>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s3v2[0:=process<3>, 1:=process<4>]
[junit] | | dyscope 5 (parent=0, static=11)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | rank = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=21)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 7 (parent=8, static=18)
[junit] | | | reachers = {2,5,6}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<1,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<7>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s6v2[0:=process<5>, 1:=process<6>]
[junit] | | dyscope 8 (parent=0, static=11)
[junit] | | | reachers = {2,5,6}
[junit] | | | variables
[junit] | | | | rank = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=26)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=11, static=23)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 1
[junit] | | dyscope 11 (parent=12, static=22)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | in = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | | | out = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | dyscope 12 (parent=4, static=19)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 13 (parent=14, static=26)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 14 (parent=15, static=23)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 15 (parent=16, static=22)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | in = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | | | out = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | dyscope 16 (parent=4, static=19)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 17 (parent=18, static=25)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 18 (parent=19, static=23)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 19 (parent=20, static=22)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | in = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | | | out = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | dyscope 20 (parent=7, static=19)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 21 (parent=22, static=25)
[junit] | | | reachers = {6}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 22 (parent=23, static=23)
[junit] | | | reachers = {6}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 23 (parent=24, static=22)
[junit] | | | reachers = {6}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | in = __message__<0,1,0,inject(0,(int[1])<0>),SIZEOF_INT>
[junit] | | | | out = __message__<1,0,0,inject(0,(int[1])<1>),SIZEOF_INT>
[junit] | | dyscope 24 (parent=7, static=19)
[junit] | | | reachers = {6}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=12, f1:41.31-36 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=52, f1:33.33-38 "$wait", scope=3]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=52, f1:33.33-38 "$wait", scope=6]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=84, f1:26.37-50 "$comm_dequeue", scope=9]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=84, f1:26.37-50 "$comm_dequeue", scope=13]
[junit] | | process 5
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=77, f1:24.37-50 "$comm_dequeue", scope=17]
[junit] | | process 6
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=77, f1:24.37-50 "$comm_dequeue", scope=21]
[junit]
[junit] New log entry is equivalent to previously encountered entry 0
[junit] Length of new trace (83) is less than length of old (109): replacing old with new...
[junit] Restricting search depth to 82
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 51291
[junit] proverCalls : 218
[junit] memory (bytes) : 433586176
[junit] time (s) : 3.74
[junit] maxProcs : 7
[junit] statesInstantiated : 4477
[junit] statesSaved : 766
[junit] statesSeen : 762
[junit] statesMatched : 63
[junit] steps : 1266
[junit] transitions : 824
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/mpi-pthreads_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 67136
[junit] proverCalls : 489
[junit] memory (bytes) : 484442112
[junit] time (s) : 5.24
[junit] maxProcs : 9
[junit] statesInstantiated : 22386
[junit] statesSaved : 3306
[junit] statesSeen : 2757
[junit] statesMatched : 0
[junit] steps : 6163
[junit] transitions : 2756
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 67408
[junit] proverCalls : 489
[junit] memory (bytes) : 484442112
[junit] time (s) : 5.36
[junit] maxProcs : 4
[junit] statesInstantiated : 469
[junit] statesSaved : 60
[junit] statesSeen : 54
[junit] statesMatched : 0
[junit] steps : 126
[junit] transitions : 53
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 68008
[junit] proverCalls : 489
[junit] memory (bytes) : 484442112
[junit] time (s) : 5.6
[junit] maxProcs : 4
[junit] statesInstantiated : 754
[junit] statesSaved : 128
[junit] statesSeen : 119
[junit] statesMatched : 0
[junit] steps : 199
[junit] transitions : 118
[junit]
[junit] The standard properties hold for all executions.
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 113:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: 0 <= SIZEOF_INT+-1
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 12, f1:41.31-36 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 52, f1:33.33-38 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 2: at location 52, f1:33.33-38 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 3: at location 84, f1:26.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 4: at location 84, f1:26.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] ProcessState 5: at location 77, f1:24.37-50 "$comm_dequeue"
[junit] Enabling predicate: false
[junit] at f1:41.31-36 "$wait".
[junit] State 644
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1,2,3,4,5}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(__gcomm__[1][])<(__gcomm__[1])<__gcomm__<2,(boolean[2])<true,true>,(__queue__[2][2])<(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>,(__queue__[2])<__queue__<0,(__message__[0])<>>,__queue__<0,(__message__[0])<>>>>>>>,(__comm__[0][])<>>
[junit] | | | | gcomm = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | dyscope 1 (parent=2, static=14)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 2 (parent=0, static=12)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | procs = X_s4v1[0:=process<1>, 1:=process<2>]
[junit] | | dyscope 3 (parent=4, static=21)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 4 (parent=5, static=18)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<0,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<4>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s3v2[0:=process<3>, 1:=process<4>]
[junit] | | dyscope 5 (parent=0, static=11)
[junit] | | | reachers = {1,3,4}
[junit] | | | variables
[junit] | | | | rank = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 6 (parent=7, static=21)
[junit] | | | reachers = {2}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 7 (parent=8, static=18)
[junit] | | | reachers = {2,5}
[junit] | | | variables
[junit] | | | | __heap = $heap<(__gcomm__[0][])<>,(__comm__[1][])<(__comm__[1])<__comm__<1,pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>>>>>
[junit] | | | | comm = pointer<scope<7>,0,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,1),0),0)>
[junit] | | | | threads = X_s6v2[0:=process<-1>, 1:=process<5>]
[junit] | | dyscope 8 (parent=0, static=11)
[junit] | | | reachers = {2,5}
[junit] | | | variables
[junit] | | | | rank = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 9 (parent=10, static=26)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 10 (parent=11, static=23)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 1
[junit] | | dyscope 11 (parent=12, static=22)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | in = __message__<1,0,0,inject(1,(int[1])<1>),SIZEOF_INT>
[junit] | | | | out = __message__<0,1,0,inject(1,(int[1])<0>),SIZEOF_INT>
[junit] | | dyscope 12 (parent=4, static=19)
[junit] | | | reachers = {3}
[junit] | | | variables
[junit] | | | | tid = 0
[junit] | | | | __heap = NULL
[junit] | | dyscope 13 (parent=14, static=26)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 1
[junit] | | dyscope 14 (parent=15, static=23)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 1
[junit] | | dyscope 15 (parent=16, static=22)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | | | in = __message__<1,0,0,inject(1,(int[1])<1>),SIZEOF_INT>
[junit] | | | | out = __message__<0,1,0,inject(1,(int[1])<0>),SIZEOF_INT>
[junit] | | dyscope 16 (parent=4, static=19)
[junit] | | | reachers = {4}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | | dyscope 17 (parent=18, static=25)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | i = 0
[junit] | | dyscope 18 (parent=19, static=23)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | j = 0
[junit] | | dyscope 19 (parent=20, static=22)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | | | | in = X_s21v2
[junit] | | | | out = __message__<1,0,0,inject(1,(int[1])<1>),SIZEOF_INT>
[junit] | | dyscope 20 (parent=7, static=19)
[junit] | | | reachers = {5}
[junit] | | | variables
[junit] | | | | tid = 1
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=12, f1:41.31-36 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=52, f1:33.33-38 "$wait", scope=3]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=MPI_Process, location=52, f1:33.33-38 "$wait", scope=6]
[junit] | | process 3
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=84, f1:26.37-50 "$comm_dequeue", scope=9]
[junit] | | process 4
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=84, f1:26.37-50 "$comm_dequeue", scope=13]
[junit] | | process 5
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=Thread, location=77, f1:24.37-50 "$comm_dequeue", scope=17]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/mpi-pthreads_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : mpi-pthreads.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 73398
[junit] proverCalls : 489
[junit] memory (bytes) : 567803904
[junit] time (s) : 5.92
[junit] maxProcs : 7
[junit] statesInstantiated : 3745
[junit] statesSaved : 645
[junit] statesSeen : 641
[junit] statesMatched : 46
[junit] steps : 1057
[junit] transitions : 686
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/mpi-pthreads_log.txt
[junit] ------------- ---------------- ---------------
[junit] Testcase: hybridMin(edu.udel.cis.vsl.civl.MessagePassingTest):SKIPPED
[junit] Testsuite: edu.udel.cis.vsl.civl.PORTest
[junit] Tests run: 7, Failures: 0, Errors: 0, Skipped: 0, Time elapsed: 0.667 sec
[junit]
[junit] ------------- Standard Output ---------------
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 5:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((*(p)==5))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:16.2-9 "$assert".
[junit] State -1:696527
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | x = 15
[junit] | | | | p = pointer<scope<0>,2,Ref<1>>
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=7, f1:16.2-9 "$assert", scope=0]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/pointerShare_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : pointerShare.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 19
[junit] proverCalls : 0
[junit] memory (bytes) : 567803904
[junit] time (s) : 0.1
[junit] maxProcs : 2
[junit] statesInstantiated : 52
[junit] statesSaved : 8
[junit] statesSeen : 8
[junit] statesMatched : 1
[junit] steps : 14
[junit] transitions : 8
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/pointerShare_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 9:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((x==3))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:25.2-9 "$assert".
[junit] State -1:696600
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | x = 4
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | proc1 = process<-1>
[junit] | | | | proc2 = process<-1>
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=11, f1:25.2-9 "$assert", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/trade3_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : trade3.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 45
[junit] proverCalls : 0
[junit] memory (bytes) : 567803904
[junit] time (s) : 0.2
[junit] maxProcs : 3
[junit] statesInstantiated : 73
[junit] statesSaved : 9
[junit] statesSeen : 9
[junit] statesMatched : 0
[junit] steps : 18
[junit] transitions : 8
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/trade3_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 6:
[junit] CIVL execution error (kind: DEADLOCK, certainty: PROVEABLE)
[junit] A deadlock is possible:
[junit] Path condition: true
[junit] Enabling predicate: false
[junit] ProcessState 0: at location 7, f1:29.2-7 "$wait"
[junit] Enabling predicate: false
[junit] ProcessState 1: at location 19, f1:14.15-16 ";"
[junit] Enabling predicate: false
[junit] ProcessState 2: terminated
[junit] at f1:29.2-7 "$wait".
[junit] State 10
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | x = 4
[junit] | | dyscope 1 (parent=0, static=5)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | | | | proc1 = process<1>
[junit] | | | | proc2 = process<2>
[junit] | | dyscope 2 (parent=0, static=3)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=7, f1:29.2-7 "$wait", scope=1]
[junit] | | process 1
[junit] | | | atomicCount = 1
[junit] | | | call stack
[junit] | | | | Frame[function=p1, location=19, f1:14.15-16 ";", scope=2]
[junit] | | process 2
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/trade4_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : trade4.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 73
[junit] proverCalls : 0
[junit] memory (bytes) : 567803904
[junit] time (s) : 0.29
[junit] maxProcs : 3
[junit] statesInstantiated : 85
[junit] statesSaved : 11
[junit] statesSeen : 11
[junit] statesMatched : 0
[junit] steps : 21
[junit] transitions : 10
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/trade4_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 3:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((x==0))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:9.4-11 "$assert".
[junit] State -1:696735
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<0>
[junit] | | | | __heap = NULL
[junit] | | | | x = 1
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 1
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=8, f1:9.4-11 "$assert", scope=0]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/atomic0_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : atomic0.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 90
[junit] proverCalls : 0
[junit] memory (bytes) : 567803904
[junit] time (s) : 0.39
[junit] maxProcs : 2
[junit] statesInstantiated : 50
[junit] statesSaved : 5
[junit] statesSeen : 5
[junit] statesMatched : 0
[junit] steps : 12
[junit] transitions : 4
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/atomic0_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 2:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((x==1))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:9.4-11 "$assert".
[junit] State -1:696756
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0,1}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<0>
[junit] | | | | __heap = NULL
[junit] | | | | x = 0
[junit] | | dyscope 1 (parent=0, static=2)
[junit] | | | reachers = {1}
[junit] | | | variables
[junit] | | | | __heap = NULL
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 1
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=8, f1:9.4-11 "$assert", scope=0]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=f, location=12, f1:4.2-3 "x", scope=1]
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/atomic1_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : atomic1.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 98
[junit] proverCalls : 0
[junit] memory (bytes) : 567803904
[junit] time (s) : 0.48
[junit] maxProcs : 2
[junit] statesInstantiated : 21
[junit] statesSaved : 2
[junit] statesSeen : 2
[junit] statesMatched : 0
[junit] steps : 4
[junit] transitions : 1
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/atomic1_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 6:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((*(p)==0))
[junit] Path condition: true
[junit] Assertion: false
[junit]
[junit] at f1:16.2-9 "$assert".
[junit] State -1:696819
[junit] | Path condition
[junit] | | true
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = NULL
[junit] | | | | x = 15
[junit] | | | | p = pointer<scope<0>,2,Ref<1>>
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=6, f1:16.2-9 "$assert", scope=0]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/pointerShare1_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : pointerShare1.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 119
[junit] proverCalls : 0
[junit] memory (bytes) : 567803904
[junit] time (s) : 0.57
[junit] maxProcs : 2
[junit] statesInstantiated : 63
[junit] statesSaved : 9
[junit] statesSeen : 9
[junit] statesMatched : 1
[junit] steps : 17
[junit] transitions : 9
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/pointerShare1_log.txt
[junit] CIVL v0.9 of 2014-03-14 -- http://vsl.cis.udel.edu/civl
[junit] Error 0 encountered at depth 7:
[junit] CIVL execution error (kind: ASSERTION_VIOLATION, certainty: PROVEABLE)
[junit] Cannot prove assertion holds: $assert((*(p)==0))
[junit] Path condition: 0 <= SIZEOF_INT+-1
[junit] Assertion: false
[junit]
[junit] at f1:19.2-9 "$assert".
[junit] State -1:696889
[junit] | Path condition
[junit] | | 0 <= SIZEOF_INT+-1
[junit] | Dynamic scopes
[junit] | | dyscope 0 (parent=-1, static=0)
[junit] | | | reachers = {0}
[junit] | | | variables
[junit] | | | | __atomic_lock_var = process<-1>
[junit] | | | | __heap = $heap<(int[1][])<H_p0s0v1i0l0[0:=15]>>
[junit] | | | | x = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | | | | p = pointer<scope<0>,1,ArrayElementRef(ArrayElementRef(TupleComponentRef(Ref<1>,0),0),0)>
[junit] | Process states
[junit] | | process 0
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit] | | | | Frame[function=_CIVL_system, location=10, f1:19.2-9 "$assert", scope=0]
[junit] | | process 1
[junit] | | | atomicCount = 0
[junit] | | | call stack
[junit]
[junit] Logging new entry 0, writing trace to CIVLREP/pointerShare2_0.trace
[junit]
[junit] File name list:
[junit] f0 : civlc.h
[junit] f1 : pointerShare2.cvl
[junit]
[junit] Error bound exceeded: search terminated
[junit]
[junit] =================== Stats ===================
[junit] validCalls : 143
[junit] proverCalls : 1
[junit] memory (bytes) : 567803904
[junit] time (s) : 0.67
[junit] maxProcs : 2
[junit] statesInstantiated : 70
[junit] statesSaved : 11
[junit] statesSeen : 10
[junit] statesMatched : 1
[junit] steps : 18
[junit] transitions : 10
[junit]
[junit] The program MAY NOT be correct. See CIVLREP/pointerShare2_log.txt
[junit] ------------- ---------------- ---------------
[junitreport] Processing /Users/tester/work/civl/0.9/r771/junit/data/TESTS-TestSuites.xml to /var/folders/tb/t0f_d_29043c_qts86hdnb1h0000gt/T/null441274098
[junitreport] Loading stylesheet jar:file:/opt/local/share/java/apache-ant/lib/ant-junit.jar!/org/apache/tools/ant/taskdefs/optional/junit/xsl/junit-frames.xsl
[junitreport] Transform time: 529ms
[junitreport] Deleting: /var/folders/tb/t0f_d_29043c_qts86hdnb1h0000gt/T/null441274098
test:
[jacoco:report] Loading execution data file /Users/tester/work/civl/0.9/r771/jacoco.exec
[jacoco:report] Writing group "Test Coverage Report for CIVL 0.9 r771" with 181 classes
javadoc:
[mkdir] Created dir: /Users/tester/work/civl/0.9/r771/doc/javadoc
[javadoc] Generating Javadoc
[javadoc] Javadoc execution
[javadoc] Loading source files for package edu.udel.cis.vsl.civl...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.err...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.gui...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.kripke...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.library...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.library.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.library.civlc...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.library.mpi...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.library.pthread...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.library.stdio...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.library.stdlib...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.log...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.expression...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.location...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.statement...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.type...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.IF.variable...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.common...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.common.expression...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.common.location...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.common.statement...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.common.type...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.model.common.variable...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.predicate...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.run...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.semantics...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.semantics.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.state...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.state.IF...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.state.immutable...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.transition...
[javadoc] Loading source files for package edu.udel.cis.vsl.civl.util...
[javadoc] Constructing Javadoc information...
[javadoc] Standard Doclet version 1.7.0_45
[javadoc] Building tree for all the packages and classes...
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/kripke/AmpleSetWorker.java:183: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/kripke/AmpleSetWorker.java:698: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/kripke/ScopedEnabler.java:116: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/kripke/ScopedEnabler.java:206: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/kripke/ScopedEnabler.java:479: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/IF/LibraryEnabler.java:50: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/Library.java:18: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/civlc/LibcivlcEnabler.java:166: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/civlc/LibcivlcEnabler.java:245: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/civlc/LibcivlcEnabler.java:351: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/civlc/LibcivlcExecutor.java:1064: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/civlc/LibcivlcExecutor.java:1130: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/mpi/LibmpiExecutor.java:80: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/mpi/LibmpiExecutor.java:114: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:216: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:223: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/CIVLFunction.java:231: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/CIVLSource.java:41: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/Model.java:150: warning - @param argument "The" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelBuilder.java:42: warning - @param argument "out" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelBuilder.java:42: warning - @param argument "debug" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:683: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:706: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:915: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:951: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1030: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1041: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1535: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:514: warning - Tag @link: reference not found: CIVLDynamicType
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1250: warning - Tag @link: reference not found: ComonModelFactory#ATOMIC_LOCK_VARIABLE
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/MPIModelFactory.java:151: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/MPIModelFactory.java:72: warning - @param argument "source" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/MPIModelFactory.java:144: warning - @param argument "scope" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/MPIModelFactory.java:186: warning - @param argument "scope" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/MPIModelFactory.java:186: warning - @param argument "functionCallNode" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/MPIModelFactory.java:206: warning - @param argument "scope" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/Scope.java:75: warning - @param argument "A" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/Scope.java:174: warning - @param argument "des" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/Expression.java:119: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:40: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:50: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/DynamicTypeOfExpression.java:23: warning - Tag @link: reference not found: CIVLDynamicType
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/LHSExpression.java:50: warning - @param argument "scope" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:16: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:23: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/SystemGuardExpression.java:30: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/expression/WaitGuardExpression.java:15: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:244: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:253: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:261: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:273: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:244: warning - @return tag cannot be used in method with void return type.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/location/Location.java:261: warning - @return tag cannot be used in method with void return type.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/statement/Statement.java:179: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/statement/Statement.java:186: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/statement/CallOrSpawnStatement.java:73: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/statement/MallocStatement.java:76: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/statement/MPIBarrierStatement.java:25: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLEnumType.java:17: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/variable/Variable.java:119: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonIdentifier.java:26: warning - @param argument "name" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonModelFactory.java:2312: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:514: warning - Tag @link: reference not found: CIVLDynamicType
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonModelFactory.java:1321: warning - @param argument "function" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/ModelFactory.java:1250: warning - Tag @link: reference not found: ComonModelFactory#ATOMIC_LOCK_VARIABLE
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:89: warning - @param argument "factory" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:108: warning - @param argument "scope" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:108: warning - @param argument "functionCallNode" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:135: warning - @param argument "scope" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:135: warning - @param argument "functionCallNode" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:194: warning - @param argument "scope" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:194: warning - @param argument "functionCallNode" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:221: warning - @param argument "scope" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonMPIModelFactory.java:221: warning - @param argument "functionCallNode" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/CommonScope.java:148: warning - @param argument "A" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/FunctionTranslator.java:1163: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/MPIFunctionTranslator.java:407: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/expression/CommonBooleanLiteralExpression.java:30: warning - @param argument "The" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/expression/CommonBooleanLiteralExpression.java:46: warning - @param argument "The" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/expression/CommonDotExpression.java:37: warning - @param argument "field" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/statement/CommonAtomBranchStatement.java:45: warning - @param argument "atomicKind" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/statement/CommonAtomicLockAssignStatement.java:51: warning - @param argument "atomicKind" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/statement/CommonCallStatement.java:52: warning - @param argument "function" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/statement/CommonIfElseBranchStatement.java:36: warning - @param argument "isTrue" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/common/type/CommonPrimitiveType.java:64: warning - @param argument "The" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/model/IF/type/CIVLType.java:52: warning - Tag @link: reference not found: PrimitiveTypeKind.VOID
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/predicate/Deadlock.java:86: warning - @param argument "evaluator" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/predicate/Deadlock.java:86: warning - @param argument "prover" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/run/UserInterface.java:743: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonEvaluator.java:1008: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonEvaluator.java:1574: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonEvaluator.java:1999: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:113: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:150: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:182: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:671: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:214: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:338: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:412: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/IF/Executor.java:116: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/IF/Executor.java:143: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:166: warning - @param argument "model" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:166: warning - @param argument "universe" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:166: warning - @param argument "prover" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:196: warning - @param argument "model" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:196: warning - @param argument "universe" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/CommonExecutor.java:196: warning - @param argument "prover" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/MPIExecutor.java:56: warning - @param argument "model" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/MPIExecutor.java:56: warning - @param argument "universe" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/MPIExecutor.java:56: warning - @param argument "prover" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:150: warning - @param argument "assumption" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/semantics/IF/Evaluator.java:298: warning - @param argument "state" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/state/IF/State.java:253: warning - @param argument "variable" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/state/IF/State.java:253: warning - @param argument "scopeID" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/state/IF/StateFactory.java:115: warning - @param argument "scopeID" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/state/immutable/ImmutableStateFactory.java:799: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/state/immutable/ImmutableStateFactory.java:401: warning - @return tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/transition/Transition.java:61: warning - @param argument "The" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/transition/Transition.java:69: warning - @param argument "The" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/util/Transmuter.java:57: warning - @param argument "m" is not a parameter name.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/gui/package-info.java:8: warning - @author tag has no arguments.
[javadoc] /Users/tester/work/civl/0.9/r771/src/edu/udel/cis/vsl/civl/library/pthread/package-info.java:8: warning - @author tag has no arguments.
[javadoc] Building index for all the packages and classes...
[javadoc] javadoc: error - Error while reading file /Users/tester/work/civl/0.9/r771/src/overview.html
[javadoc] Building index for all classes...
[javadoc] Generating /Users/tester/work/civl/0.9/r771/doc/javadoc/help-doc.html...
[javadoc] 1 error
[javadoc] 131 warnings
bench-compile:
[javac] Compiling 5 source files to /Users/tester/work/civl/0.9/r771/bin
all:
BUILD SUCCESSFUL
Total time: 1 minute 4 seconds
Stderr: