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-PT-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-149581174300123
=====================================================================

--------------------
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-010-LTLFireability-0
FORMULA_NAME Referendum-COL-010-LTLFireability-1
FORMULA_NAME Referendum-COL-010-LTLFireability-10
FORMULA_NAME Referendum-COL-010-LTLFireability-11
FORMULA_NAME Referendum-COL-010-LTLFireability-12
FORMULA_NAME Referendum-COL-010-LTLFireability-13
FORMULA_NAME Referendum-COL-010-LTLFireability-14
FORMULA_NAME Referendum-COL-010-LTLFireability-15
FORMULA_NAME Referendum-COL-010-LTLFireability-2
FORMULA_NAME Referendum-COL-010-LTLFireability-3
FORMULA_NAME Referendum-COL-010-LTLFireability-4
FORMULA_NAME Referendum-COL-010-LTLFireability-5
FORMULA_NAME Referendum-COL-010-LTLFireability-6
FORMULA_NAME Referendum-COL-010-LTLFireability-7
FORMULA_NAME Referendum-COL-010-LTLFireability-8
FORMULA_NAME Referendum-COL-010-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496286022636


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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))U(F(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))))U(G(F(G("ready>=1"))))))
Formula 0 simplified : !((("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1") U F("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")) U GFG"ready>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 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.081486,27336,1,0,45,2350,24,56,446,3493,177
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))U(X(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1")))))
Formula 1 simplified : !(("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1") U X("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1"))
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.102978,27596,1,0,45,2350,91,56,509,3493,183
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-COL-010-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1")))
Formula 2 simplified : !("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
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
// Phase 1: matrix 21 rows 31 cols
STATS,0,0.109385,27700,1,0,45,2350,97,57,530,3535,193
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((((X("ready>=1"))U(X("ready>=1")))U(X("ready>=1"))))
Formula 3 simplified : !X"ready>=1"
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.110407,27700,1,0,45,2350,97,57,530,3553,200
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(G("ready>=1"))))
Formula 4 simplified : !G"ready>=1"
3 unique states visited
invariant : 1'ready + 1'voted_no_3 + 1'voted_yes_3 + 1'voting_3= 1
invariant : 1'ready + 1'voted_no_5 + 1'voted_yes_5 + 1'voting_5= 1
invariant : 1'ready + 1'voted_no_7 + 1'voted_yes_7 + 1'voting_7= 1
invariant : 1'ready + 1'voted_no_1 + 1'voted_yes_1 + 1'voting_1= 1
invariant : 1'ready + 1'voted_no_9 + 1'voted_yes_9 + 1'voting_9= 1
invariant : 1'ready + 1'voted_no_8 + 1'voted_yes_8 + 1'voting_8= 1
invariant : 1'ready + 1'voted_no_6 + 1'voted_yes_6 + 1'voting_6= 1
invariant : 1'ready + 1'voted_no_2 + 1'voted_yes_2 + 1'voting_2= 1
invariant : 1'ready + 1'voted_no_10 + 1'voted_yes_10 + 1'voting_10= 1
invariant : 1'ready + 1'voted_no_4 + 1'voted_yes_4 + 1'voting_4= 1
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.111049,27700,1,0,45,2350,97,57,530,3553,203
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))U("ready>=1")))
Formula 5 simplified : !(("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1") U "ready>=1")
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.13573,27512,1,0,45,2350,166,57,597,3553,207
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-COL-010-LTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((F(X(X(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1")))))U((F(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1")))U(F(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))))))
Formula 6 simplified : !(FXX("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1") U F("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1"))
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.139582,27648,1,0,45,2350,172,57,597,3553,211
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Referendum-COL-010-LTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1")))
Formula 7 simplified : !("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")
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.144401,27648,1,0,45,2350,172,57,597,3553,211
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(F(G(X(X(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))))))))
Formula 8 simplified : !GFGXX("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")
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.22847,27788,1,0,45,2350,172,59,597,3835,247
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(F(G(X(G(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))))))))
Formula 9 simplified : !GFGXG("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")
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.321382,27788,1,0,45,2350,172,59,597,3835,247
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))))
Formula 10 simplified : !F("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")
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.324826,27788,1,0,45,2350,172,59,597,3835,247
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Referendum-COL-010-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(X(G(G(G("ready>=1")))))))
Formula 11 simplified : !XXG"ready>=1"
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.326319,27788,1,0,46,2398,172,60,597,3894,258
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1")))
Formula 12 simplified : !("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")
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.331221,27788,1,0,46,2398,172,60,597,3894,258
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X(("ready>=1")U("ready>=1")))U(G(X(G(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1")))))))
Formula 13 simplified : !(X"ready>=1" U GXG("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1"))
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]
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.660914,27964,1,0,46,2398,178,60,601,3894,262
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(F(F(G(F(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))))))))
Formula 14 simplified : !GFGF("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")
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.692438,28104,1,0,48,2409,178,62,601,3897,290
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(G(F(((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))))))
Formula 15 simplified : !XGF("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1")
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.718566,28104,1,0,48,2409,178,62,601,3897,290
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-COL-010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496286027583

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 01, 2017 3:00:25 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 3:00:25 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 54 ms
Jun 01, 2017 3:00:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 31 places.
Jun 01, 2017 3:00:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 21 transitions.
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 32 ms
Jun 01, 2017 3:00:26 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
Jun 01, 2017 3:00:26 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 24 ms
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 31 variables to be positive in 117 ms
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 21 transitions.
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/21 took 3 ms. Total solver calls (SAT/UNSAT): 3(2/1)
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 61(41/20)
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 21 transitions.
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 61(20/41)
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 21 transitions.
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 126 ms. Total solver calls (SAT/UNSAT): 231(190/41)
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 21 transitions.
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2017 3:00:26 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 627ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 3:00:27 AM 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states
Computing Next relation with stutter on 1024 deadlock states

Jun 01, 2017 3:00:27 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 01, 2017 3:00:27 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 01, 2017 3:00:27 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTS min runner thread failed on error :java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:66)
at java.lang.Thread.run(Thread.java:748)

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="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-PT-0010.tgz
mv Referendum-PT-0010 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-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 r210-smll-149581174300123"
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 ;