Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................................
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is Referendum-COL-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-149581174200068
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-COL-020-LTLCardinality-0
FORMULA_NAME Referendum-COL-020-LTLCardinality-1
FORMULA_NAME Referendum-COL-020-LTLCardinality-10
FORMULA_NAME Referendum-COL-020-LTLCardinality-11
FORMULA_NAME Referendum-COL-020-LTLCardinality-12
FORMULA_NAME Referendum-COL-020-LTLCardinality-13
FORMULA_NAME Referendum-COL-020-LTLCardinality-14
FORMULA_NAME Referendum-COL-020-LTLCardinality-15
FORMULA_NAME Referendum-COL-020-LTLCardinality-2
FORMULA_NAME Referendum-COL-020-LTLCardinality-3
FORMULA_NAME Referendum-COL-020-LTLCardinality-4
FORMULA_NAME Referendum-COL-020-LTLCardinality-5
FORMULA_NAME Referendum-COL-020-LTLCardinality-6
FORMULA_NAME Referendum-COL-020-LTLCardinality-7
FORMULA_NAME Referendum-COL-020-LTLCardinality-8
FORMULA_NAME Referendum-COL-020-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496274438599


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(G("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=3"))))
Formula 0 simplified : !FG"(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=3"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
26 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.294269,26916,1,0,120,12783,24,105,1295,18590,325
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])<=ready[0]"))
Formula 1 simplified : !"(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])<=ready[0]"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.296907,26916,1,0,120,12783,27,105,1318,18590,327
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(G("ready[0]>=1")))U(X(G("ready[0]<=(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])")))))
Formula 2 simplified : !(G"ready[0]>=1" U XG"ready[0]<=(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])")
23 unique states visited
0 strongly connected components in search stack
23 transitions explored
22 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.455089,30356,1,0,137,14368,48,194,1789,27284,587
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=2"))
Formula 3 simplified : !"(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.459056,30424,1,0,137,14376,57,197,1849,27384,602
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X("(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=3"))))
Formula 4 simplified : !GX"(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=3"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.464318,30688,1,0,137,14376,63,197,1889,27422,612
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(F("ready[0]<=(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])")))U(F(G("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])<=(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])")))))
Formula 5 simplified : !(F"ready[0]<=(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])" U FG"(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])<=(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
271 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.17172,54776,1,0,256,91786,76,302,8474,187250,958
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G(G(G("(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=2"))))))
Formula 6 simplified : !FG"(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=2"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
56 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.73236,62068,1,0,406,121673,89,481,8894,255706,1402
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((F("ready[0]<=(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])"))U(G("(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])<=(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])")))))
Formula 7 simplified : !X(F"ready[0]<=(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])" U G"(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])<=(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])")
25 unique states visited
23 strongly connected components in search stack
27 transitions explored
23 items max in DFS search stack
190 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.62679,84628,1,0,541,187410,100,610,14500,393557,1825
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G(("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=3")U("(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=2")))))
Formula 8 simplified : !G("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=3" U "(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=2")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.63126,85128,1,0,541,187410,112,610,14507,393557,1832
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X(X(G("(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=1"))))))
Formula 9 simplified : !GXXG"(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=1"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
15 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.7793,86124,1,0,618,191029,118,690,14925,403946,2007
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((("ready[0]<=(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])")U("ready[0]<=(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])"))U(X(G("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=3")))))
Formula 10 simplified : !("ready[0]<=(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])" U XG"(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=3")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.83671,86920,1,0,620,191031,126,710,15159,404219,2100
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(F(X(F("(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])<=(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])"))))))
Formula 11 simplified : !FXF"(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])<=(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.83893,87164,1,0,620,191031,132,710,15159,404219,2104
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(F(("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])<=(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])")U("(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])>=2")))))
Formula 12 simplified : !XF("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])<=(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])" U "(((((((((((((((((((voted_yes[0]+voted_yes[1])+voted_yes[2])+voted_yes[3])+voted_yes[4])+voted_yes[5])+voted_yes[6])+voted_yes[7])+voted_yes[8])+voted_yes[9])+voted_yes[10])+voted_yes[11])+voted_yes[12])+voted_yes[13])+voted_yes[14])+voted_yes[15])+voted_yes[16])+voted_yes[17])+voted_yes[18])+voted_yes[19])>=2")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
32 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.15836,88452,1,0,712,203275,141,788,15217,428156,2311
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(F(X(X("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=3"))))))
Formula 13 simplified : !GFXX"(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])>=3"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.16069,88608,1,0,712,203276,147,791,15217,428232,2325
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((F(G("(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])<=ready[0]")))U(X(F("ready[0]<=(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])")))))
Formula 14 simplified : !(FG"(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])<=ready[0]" U XF"ready[0]<=(((((((((((((((((((voting[0]+voting[1])+voting[2])+voting[3])+voting[4])+voting[5])+voting[6])+voting[7])+voting[8])+voting[9])+voting[10])+voting[11])+voting[12])+voting[13])+voting[14])+voting[15])+voting[16])+voting[17])+voting[18])+voting[19])")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.1625,88784,1,0,712,203276,153,791,15217,428232,2327
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(G(G(X("(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=3"))))))
Formula 15 simplified : !FGX"(((((((((((((((((((voted_no[0]+voted_no[1])+voted_no[2])+voted_no[3])+voted_no[4])+voted_no[5])+voted_no[6])+voted_no[7])+voted_no[8])+voted_no[9])+voted_no[10])+voted_no[11])+voted_no[12])+voted_no[13])+voted_no[14])+voted_no[15])+voted_no[16])+voted_no[17])+voted_no[18])+voted_no[19])>=3"
25 unique states visited
24 strongly connected components in search stack
27 transitions explored
25 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.25729,89716,1,0,732,209350,155,853,15407,444599,2512
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exit code :0

BK_STOP 1496274450378

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 11:47:20 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 11:47:20 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 31, 2017 11:47:22 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1631 ms
May 31, 2017 11:47:22 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 4 places.
May 31, 2017 11:47:22 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 31, 2017 11:47:22 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Dot->ready,
Voters->voted_no,voted_yes,voting,

May 31, 2017 11:47:22 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 3 transitions.
May 31, 2017 11:47:22 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 31, 2017 11:47:22 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 65 ms
May 31, 2017 11:47:22 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 14 ms
May 31, 2017 11:47:22 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 6 ms
May 31, 2017 11:47:29 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-COL-0020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0020.tgz
mv Referendum-COL-0020 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is Referendum-COL-0020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-149581174200068"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;