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)
............................................................................
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Referendum-PT-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732140900114
=====================================================================

--------------------
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-PT-0010-LTLFireability-00
FORMULA_NAME Referendum-PT-0010-LTLFireability-01
FORMULA_NAME Referendum-PT-0010-LTLFireability-02
FORMULA_NAME Referendum-PT-0010-LTLFireability-03
FORMULA_NAME Referendum-PT-0010-LTLFireability-04
FORMULA_NAME Referendum-PT-0010-LTLFireability-05
FORMULA_NAME Referendum-PT-0010-LTLFireability-06
FORMULA_NAME Referendum-PT-0010-LTLFireability-07
FORMULA_NAME Referendum-PT-0010-LTLFireability-08
FORMULA_NAME Referendum-PT-0010-LTLFireability-09
FORMULA_NAME Referendum-PT-0010-LTLFireability-10
FORMULA_NAME Referendum-PT-0010-LTLFireability-11
FORMULA_NAME Referendum-PT-0010-LTLFireability-12
FORMULA_NAME Referendum-PT-0010-LTLFireability-13
FORMULA_NAME Referendum-PT-0010-LTLFireability-14
FORMULA_NAME Referendum-PT-0010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1528321693276

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph3520726508522387330.txt, -o, /tmp/graph3520726508522387330.bin, -w, /tmp/graph3520726508522387330.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph3520726508522387330.bin, -l, -1, -v, -w, /tmp/graph3520726508522387330.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")U(X(X("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")))))
Formula 0 simplified : !("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))" U XX"((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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.070777,16992,1,0,161,63,165,84,74,64,396
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(X(("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")U("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))"))))))
Formula 1 simplified : !GXX"((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))"
Computing Next relation with stutter on 1024 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.080496,17204,1,0,714,72,208,570,80,80,1401
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")U(G(F(X("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))"))))))
Formula 2 simplified : !("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))" U GFX"((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.088157,17784,1,0,916,81,214,820,80,100,1930
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((G(X("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")))U(G(G("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))"))))))
Formula 3 simplified : !G(GX"((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))" U G"((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")
Computing Next relation with stutter on 1024 deadlock states
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.095459,18272,1,0,967,81,214,883,80,100,2041
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G(G("(u3.ready>=1)")))U("(u3.ready>=1)"))))
Formula 4 simplified : !X(G"(u3.ready>=1)" U "(u3.ready>=1)")
Computing Next relation with stutter on 1024 deadlock states
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,0.096917,18272,1,0,967,81,219,883,81,100,2069
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X("(u3.ready>=1)"))U(G(G(X("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))"))))))
Formula 5 simplified : !(X"(u3.ready>=1)" U GX"((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")
Computing Next relation with stutter on 1024 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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.10375,18724,1,0,967,81,225,883,81,101,2081
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(u3.ready>=1)"))
Formula 6 simplified : !"(u3.ready>=1)"
Computing Next relation with stutter on 1024 deadlock states
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.10407,18724,1,0,967,81,225,883,81,101,2090
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("(u3.ready>=1)")U(G("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")))U(X(("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))")U("(u3.ready>=1)")))))
Formula 7 simplified : !(("(u3.ready>=1)" U G"((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))") U X("((((((((((u2.voting_1>=1)||(u3.voting_2>=1))||(u0.voting_3>=1))||(u4.voting_4>=1))||(u5.voting_5>=1))||(u6.voting_6>=1))||(u7.voting_7>=1))||(u8.voting_8>=1))||(u1.voting_9>=1))||(u9.voting_10>=1))" U "(u3.ready>=1)"))
Computing Next relation with stutter on 1024 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.111558,18988,1,0,967,81,227,890,81,102,2215
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F("(u1.voting_9>=1)"))U("(u9.voting_10>=1)")))
Formula 8 simplified : !(F"(u1.voting_9>=1)" U "(u9.voting_10>=1)")
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,0.113039,18988,1,0,967,81,255,890,82,102,2253
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(u7.voting_7>=1)"))
Formula 9 simplified : !"(u7.voting_7>=1)"
Computing Next relation with stutter on 1024 deadlock states
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.113411,18988,1,0,967,81,257,890,82,102,2261
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X("(u0.voting_3>=1)")))
Formula 10 simplified : !X"(u0.voting_3>=1)"
Computing Next relation with stutter on 1024 deadlock states
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,0.113644,18988,1,0,967,81,259,890,82,102,2272
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(("(u7.voting_7>=1)")U(G(X("(u3.voting_2>=1)"))))))
Formula 11 simplified : !F("(u7.voting_7>=1)" U GX"(u3.voting_2>=1)")
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
12 strongly connected components in search stack
14 transitions explored
13 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.117015,18988,1,0,1165,81,282,1078,83,103,2698
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G("(u8.voting_8>=1)")))
Formula 12 simplified : !G"(u8.voting_8>=1)"
Computing Next relation with stutter on 1024 deadlock states
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.117634,18988,1,0,1165,81,295,1078,83,103,2707
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(("(u9.voting_10>=1)")U(G("(u8.voting_8>=1)"))))))
Formula 13 simplified : !FG("(u9.voting_10>=1)" U G"(u8.voting_8>=1)")
Computing Next relation with stutter on 1024 deadlock states
10 unique states visited
10 strongly connected components in search stack
10 transitions explored
10 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.121324,19252,1,0,1196,81,319,1122,83,103,3066
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(G(F("(u5.voting_5>=1)")))))
Formula 14 simplified : !GF"(u5.voting_5>=1)"
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.12326,19252,1,0,1341,81,341,1245,83,103,3374
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X((F(G("(u3.voting_2>=1)")))U(X("(u1.voting_9>=1)")))))
Formula 15 simplified : !X(FG"(u3.voting_2>=1)" U X"(u1.voting_9>=1)")
Computing Next relation with stutter on 1024 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.127992,19252,1,0,1761,81,356,1630,83,103,4153
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1528321711278

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 06, 2018 9:48:28 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 06, 2018 9:48:28 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 39 ms
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 31 places.
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 21 transitions.
Jun 06, 2018 9:48:29 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 9 ms
Begin: Wed Jun 6 21:48:29 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Wed Jun 6 21:48:29 2018
network size: 31 nodes, 60 links, 42 weight
quality increased from -0.0369048 to 0.856633
end computation: Wed Jun 6 21:48:29 2018
level 1:
start computation: Wed Jun 6 21:48:29 2018
network size: 10 nodes, 28 links, 42 weight
quality increased from 0.856633 to 0.856633
end computation: Wed Jun 6 21:48:29 2018
End: Wed Jun 6 21:48:29 2018
Total duration: 0 sec
0.856633
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 17 ms
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 9:48:29 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Jun 06, 2018 9:48:29 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Jun 06, 2018 9:48:29 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 21 transitions.
Jun 06, 2018 9:48:30 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun _enabled__16 ((step Int)) Bool (_enabledsrc__16 (select s step))) with error
Jun 06, 2018 9:48:30 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun trsrc16 ((src (Array Int Int))(dst (Array Int Int))) Bool (and (_enabledsrc__16 src) (= (store (store src 24 (- (select src 24) 1)) 23 (+ (select src 23) 1)) dst))) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Skipping mayMatrices nes/nds Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:59)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 06, 2018 9:48:30 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 229ms conformant to PINS in folder :/home/mcc/execution

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-PT-0010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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-PT-0010.tgz
mv Referendum-PT-0010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is Referendum-PT-0010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-qhx2-152732140900114"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;