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 212K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 42K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Peterson-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585400148
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527489041407

06:30:44.002 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
06:30:44.004 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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.201805151631/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.201805151631/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 : !((G(G(G(X(G("(((ProcTour1.endTurn_1>=1)||(ProcTour3.endTurn_3>=1))||(ProcTour5.endTurn_5>=1))")))))))
Formula 0 simplified : !GXG"(((ProcTour1.endTurn_1>=1)||(ProcTour3.endTurn_3>=1))||(ProcTour5.endTurn_5>=1))"
built 103 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions updateTurn_0_0_0, updateTurn_0_0_1, updateTurn_0_0_2, updateTurn_0_1_0, updateTurn_0_1_1, updateTurn_0_1_2, updateTurn_0_2_0, updateTurn_0_2_1, updateTurn_0_2_2, updateTurn_1_0_0, updateTurn_1_0_1, updateTurn_1_0_2, updateTurn_1_1_0, updateTurn_1_1_1, updateTurn_1_1_2, updateTurn_1_2_0, updateTurn_1_2_1, updateTurn_1_2_2, becomeIdle_0, becomeIdle_1, becomeIdle_2, notAlone_0_0_2, notAlone_0_1_2, notAlone_0_2_1, notAlone_1_0_2, notAlone_1_1_2, notAlone_1_2_1, endLoop_0_0, endLoop_0_1, endLoop_0_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :12/96/30/138
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 132
// Phase 1: matrix 132 rows 108 cols
invariant :ProcBool3:wantSection_3 + Process1:idle_1 = 1
invariant :ProcBool2:wantSection_2 + -1'Process1:idle_1 = 0
invariant :ProcTourProc6:beginLoop_6 + ProcTourProc6:testIdentity_6 + ProcTourProc6:testAlone_6 + ProcTourProc6:isEndLoop_6 + ProcTourProc7:beginLoop_7 + ProcTourProc7:testIdentity_7 + ProcTourProc7:testAlone_7 + ProcTourProc7:isEndLoop_7 + ProcTourProc8:beginLoop_8 + ProcTourProc8:testIdentity_8 + ProcTourProc8:testAlone_8 + ProcTourProc8:isEndLoop_8 + ProcTourProc9:beginLoop_9 + ProcTourProc9:testIdentity_9 + ProcTourProc9:testAlone_9 + ProcTourProc9:isEndLoop_9 + ProcTourProc10:beginLoop_10 + ProcTourProc10:testIdentity_10 + ProcTourProc10:testAlone_10 + ProcTourProc10:isEndLoop_10 + ProcTourProc11:beginLoop_11 + ProcTourProc11:testIdentity_11 + ProcTourProc11:testAlone_11 + ProcTourProc11:isEndLoop_11 + ProcTour2:askForSection_2 + ProcTour2:testTurn_2 + ProcTour2:endTurn_2 + ProcTour3:askForSection_3 + ProcTour3:testTurn_3 + ProcTour3:endTurn_3 + Process1:idle_1 + Process1:CS_1 = 1
invariant :TourProc0:turn_0 + TourProc1:turn_1 + TourProc2:turn_2 = 1
invariant :ProcTourProc12:beginLoop_12 + ProcTourProc12:testIdentity_12 + ProcTourProc12:testAlone_12 + ProcTourProc12:isEndLoop_12 + ProcTourProc13:beginLoop_13 + ProcTourProc13:testIdentity_13 + ProcTourProc13:testAlone_13 + ProcTourProc13:isEndLoop_13 + ProcTourProc14:beginLoop_14 + ProcTourProc14:testIdentity_14 + ProcTourProc14:testAlone_14 + ProcTourProc14:isEndLoop_14 + ProcTourProc15:beginLoop_15 + ProcTourProc15:testIdentity_15 + ProcTourProc15:testAlone_15 + ProcTourProc15:isEndLoop_15 + ProcTourProc16:beginLoop_16 + ProcTourProc16:testIdentity_16 + ProcTourProc16:testAlone_16 + ProcTourProc16:isEndLoop_16 + ProcTourProc17:beginLoop_17 + ProcTourProc17:testIdentity_17 + ProcTourProc17:testAlone_17 + ProcTourProc17:isEndLoop_17 + ProcTour4:askForSection_4 + ProcTour4:testTurn_4 + ProcTour4:endTurn_4 + ProcTour5:askForSection_5 + ProcTour5:testTurn_5 + ProcTour5:endTurn_5 + Process2:idle_2 + Process2:CS_2 = 1
invariant :ProcBool5:wantSection_5 + Process2:idle_2 = 1
invariant :ProcBool0:wantSection_0 + -1'Process0:idle_0 = 0
invariant :ProcBool1:wantSection_1 + Process0:idle_0 = 1
invariant :TourProc3:turn_3 + TourProc4:turn_4 + TourProc5:turn_5 = 1
invariant :ProcTourProc0:beginLoop_0 + ProcTourProc0:testIdentity_0 + ProcTourProc0:testAlone_0 + ProcTourProc0:isEndLoop_0 + ProcTourProc1:beginLoop_1 + ProcTourProc1:testIdentity_1 + ProcTourProc1:testAlone_1 + ProcTourProc1:isEndLoop_1 + ProcTourProc2:beginLoop_2 + ProcTourProc2:testIdentity_2 + ProcTourProc2:testAlone_2 + ProcTourProc2:isEndLoop_2 + ProcTourProc3:beginLoop_3 + ProcTourProc3:testIdentity_3 + ProcTourProc3:testAlone_3 + ProcTourProc3:isEndLoop_3 + ProcTourProc4:beginLoop_4 + ProcTourProc4:testIdentity_4 + ProcTourProc4:testAlone_4 + ProcTourProc4:isEndLoop_4 + ProcTourProc5:beginLoop_5 + ProcTourProc5:testIdentity_5 + ProcTourProc5:testAlone_5 + ProcTourProc5:isEndLoop_5 + ProcTour0:askForSection_0 + ProcTour0:testTurn_0 + ProcTour0:endTurn_0 + ProcTour1:askForSection_1 + ProcTour1:testTurn_1 + ProcTour1:endTurn_1 + Process0:idle_0 + Process0:CS_0 = 1
invariant :ProcBool4:wantSection_4 + -1'Process2:idle_2 = 0
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
44 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.490849,34148,1,0,36719,256,1721,50370,97,366,155284
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((ProcBool0.wantSection_0>=1)&&(Process0.idle_0>=1))||((ProcBool2.wantSection_2>=1)&&(Process1.idle_1>=1)))||((ProcBool4.wantSection_4>=1)&&(Process2.idle_2>=1)))"))
Formula 1 simplified : !"((((ProcBool0.wantSection_0>=1)&&(Process0.idle_0>=1))||((ProcBool2.wantSection_2>=1)&&(Process1.idle_1>=1)))||((ProcBool4.wantSection_4>=1)&&(Process2.idle_2>=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.492146,34528,1,0,36719,256,1737,50370,97,366,155328
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(X(X("(((((((TourProc0.turn_0>=1)&&(ProcTour0.testTurn_0>=1))||((TourProc1.turn_1>=1)&&(ProcTour2.testTurn_2>=1)))||((TourProc2.turn_2>=1)&&(ProcTour4.testTurn_4>=1)))||((TourProc3.turn_3>=1)&&(ProcTour1.testTurn_1>=1)))||((TourProc4.turn_4>=1)&&(ProcTour3.testTurn_3>=1)))||((TourProc5.turn_5>=1)&&(ProcTour5.testTurn_5>=1)))"))))U((X("((((((((((((((((((ProcTourProc0.beginLoop_0>=1)||(ProcTourProc1.beginLoop_1>=1))||(ProcTourProc2.beginLoop_2>=1))||(ProcTourProc6.beginLoop_6>=1))||(ProcTourProc7.beginLoop_7>=1))||(ProcTourProc8.beginLoop_8>=1))||(ProcTourProc12.beginLoop_12>=1))||(ProcTourProc13.beginLoop_13>=1))||(ProcTourProc14.beginLoop_14>=1))||(ProcTourProc3.beginLoop_3>=1))||(ProcTourProc4.beginLoop_4>=1))||(ProcTourProc5.beginLoop_5>=1))||(ProcTourProc9.beginLoop_9>=1))||(ProcTourProc10.beginLoop_10>=1))||(ProcTourProc11.beginLoop_11>=1))||(ProcTourProc15.beginLoop_15>=1))||(ProcTourProc16.beginLoop_16>=1))||(ProcTourProc17.beginLoop_17>=1))"))U(F("((((((((((((((((((ProcTourProc0.beginLoop_0>=1)||(ProcTourProc1.beginLoop_1>=1))||(ProcTourProc2.beginLoop_2>=1))||(ProcTourProc6.beginLoop_6>=1))||(ProcTourProc7.beginLoop_7>=1))||(ProcTourProc8.beginLoop_8>=1))||(ProcTourProc12.beginLoop_12>=1))||(ProcTourProc13.beginLoop_13>=1))||(ProcTourProc14.beginLoop_14>=1))||(ProcTourProc3.beginLoop_3>=1))||(ProcTourProc4.beginLoop_4>=1))||(ProcTourProc5.beginLoop_5>=1))||(ProcTourProc9.beginLoop_9>=1))||(ProcTourProc10.beginLoop_10>=1))||(ProcTourProc11.beginLoop_11>=1))||(ProcTourProc15.beginLoop_15>=1))||(ProcTourProc16.beginLoop_16>=1))||(ProcTourProc17.beginLoop_17>=1))")))))
Formula 2 simplified : !(GXX"(((((((TourProc0.turn_0>=1)&&(ProcTour0.testTurn_0>=1))||((TourProc1.turn_1>=1)&&(ProcTour2.testTurn_2>=1)))||((TourProc2.turn_2>=1)&&(ProcTour4.testTurn_4>=1)))||((TourProc3.turn_3>=1)&&(ProcTour1.testTurn_1>=1)))||((TourProc4.turn_4>=1)&&(ProcTour3.testTurn_3>=1)))||((TourProc5.turn_5>=1)&&(ProcTour5.testTurn_5>=1)))" U (X"((((((((((((((((((ProcTourProc0.beginLoop_0>=1)||(ProcTourProc1.beginLoop_1>=1))||(ProcTourProc2.beginLoop_2>=1))||(ProcTourProc6.beginLoop_6>=1))||(ProcTourProc7.beginLoop_7>=1))||(ProcTourProc8.beginLoop_8>=1))||(ProcTourProc12.beginLoop_12>=1))||(ProcTourProc13.beginLoop_13>=1))||(ProcTourProc14.beginLoop_14>=1))||(ProcTourProc3.beginLoop_3>=1))||(ProcTourProc4.beginLoop_4>=1))||(ProcTourProc5.beginLoop_5>=1))||(ProcTourProc9.beginLoop_9>=1))||(ProcTourProc10.beginLoop_10>=1))||(ProcTourProc11.beginLoop_11>=1))||(ProcTourProc15.beginLoop_15>=1))||(ProcTourProc16.beginLoop_16>=1))||(ProcTourProc17.beginLoop_17>=1))" U F"((((((((((((((((((ProcTourProc0.beginLoop_0>=1)||(ProcTourProc1.beginLoop_1>=1))||(ProcTourProc2.beginLoop_2>=1))||(ProcTourProc6.beginLoop_6>=1))||(ProcTourProc7.beginLoop_7>=1))||(ProcTourProc8.beginLoop_8>=1))||(ProcTourProc12.beginLoop_12>=1))||(ProcTourProc13.beginLoop_13>=1))||(ProcTourProc14.beginLoop_14>=1))||(ProcTourProc3.beginLoop_3>=1))||(ProcTourProc4.beginLoop_4>=1))||(ProcTourProc5.beginLoop_5>=1))||(ProcTourProc9.beginLoop_9>=1))||(ProcTourProc10.beginLoop_10>=1))||(ProcTourProc11.beginLoop_11>=1))||(ProcTourProc15.beginLoop_15>=1))||(ProcTourProc16.beginLoop_16>=1))||(ProcTourProc17.beginLoop_17>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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.55369,37248,1,0,42000,256,1858,55404,97,366,174023
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))")U("(((ProcTour1.endTurn_1>=1)||(ProcTour3.endTurn_3>=1))||(ProcTour5.endTurn_5>=1))"))U(G(F(X("((((((((((((ProcTourProc0.isEndLoop_0>=1)||(ProcTourProc1.isEndLoop_1>=1))||(ProcTourProc6.isEndLoop_6>=1))||(ProcTourProc7.isEndLoop_7>=1))||(ProcTourProc12.isEndLoop_12>=1))||(ProcTourProc13.isEndLoop_13>=1))||(ProcTourProc3.isEndLoop_3>=1))||(ProcTourProc4.isEndLoop_4>=1))||(ProcTourProc9.isEndLoop_9>=1))||(ProcTourProc10.isEndLoop_10>=1))||(ProcTourProc15.isEndLoop_15>=1))||(ProcTourProc16.isEndLoop_16>=1))"))))))
Formula 3 simplified : !(("((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))" U "(((ProcTour1.endTurn_1>=1)||(ProcTour3.endTurn_3>=1))||(ProcTour5.endTurn_5>=1))") U GFX"((((((((((((ProcTourProc0.isEndLoop_0>=1)||(ProcTourProc1.isEndLoop_1>=1))||(ProcTourProc6.isEndLoop_6>=1))||(ProcTourProc7.isEndLoop_7>=1))||(ProcTourProc12.isEndLoop_12>=1))||(ProcTourProc13.isEndLoop_13>=1))||(ProcTourProc3.isEndLoop_3>=1))||(ProcTourProc4.isEndLoop_4>=1))||(ProcTourProc9.isEndLoop_9>=1))||(ProcTourProc10.isEndLoop_10>=1))||(ProcTourProc15.isEndLoop_15>=1))||(ProcTourProc16.isEndLoop_16>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
49 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,1.04311,56380,1,0,85554,256,1957,108029,97,465,297153
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("(((ProcTour1.endTurn_1>=1)||(ProcTour3.endTurn_3>=1))||(ProcTour5.endTurn_5>=1))")U(G(F(G("(((ProcTour0.endTurn_0>=1)||(ProcTour2.endTurn_2>=1))||(ProcTour4.endTurn_4>=1))"))))))
Formula 4 simplified : !("(((ProcTour1.endTurn_1>=1)||(ProcTour3.endTurn_3>=1))||(ProcTour5.endTurn_5>=1))" U GFG"(((ProcTour0.endTurn_0>=1)||(ProcTour2.endTurn_2>=1))||(ProcTour4.endTurn_4>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
96 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,2.00885,97196,1,0,187421,256,1984,203177,97,471,589820
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((("((((((ProcTourProc2.isEndLoop_2>=1)||(ProcTourProc8.isEndLoop_8>=1))||(ProcTourProc14.isEndLoop_14>=1))||(ProcTourProc5.isEndLoop_5>=1))||(ProcTourProc11.isEndLoop_11>=1))||(ProcTourProc17.isEndLoop_17>=1))")U("((((Process0.CS_0>=1)&&(ProcBool1.wantSection_1>=1))||((Process1.CS_1>=1)&&(ProcBool3.wantSection_3>=1)))||((Process2.CS_2>=1)&&(ProcBool5.wantSection_5>=1)))"))U(("(((((((((((((((((((ProcBool0.wantSection_0>=1)&&(ProcTourProc0.testAlone_0>=1))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc1.testAlone_1>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc2.testAlone_2>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc6.testAlone_6>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc7.testAlone_7>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc8.testAlone_8>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc12.testAlone_12>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc13.testAlone_13>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc14.testAlone_14>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc3.testAlone_3>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc4.testAlone_4>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc5.testAlone_5>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc9.testAlone_9>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc10.testAlone_10>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc11.testAlone_11>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc15.testAlone_15>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc16.testAlone_16>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc17.testAlone_17>=1)))")U("(((((((((((((ProcTour0.testTurn_0>=1)&&(TourProc1.turn_1>=1))||((ProcTour0.testTurn_0>=1)&&(TourProc2.turn_2>=1)))||((ProcTour2.testTurn_2>=1)&&(TourProc0.turn_0>=1)))||((ProcTour2.testTurn_2>=1)&&(TourProc2.turn_2>=1)))||((ProcTour4.testTurn_4>=1)&&(TourProc0.turn_0>=1)))||((ProcTour4.testTurn_4>=1)&&(TourProc1.turn_1>=1)))||((ProcTour1.testTurn_1>=1)&&(TourProc4.turn_4>=1)))||((ProcTour1.testTurn_1>=1)&&(TourProc5.turn_5>=1)))||((ProcTour3.testTurn_3>=1)&&(TourProc3.turn_3>=1)))||((ProcTour3.testTurn_3>=1)&&(TourProc5.turn_5>=1)))||((ProcTour5.testTurn_5>=1)&&(TourProc3.turn_3>=1)))||((ProcTour5.testTurn_5>=1)&&(TourProc4.turn_4>=1)))")))))
Formula 5 simplified : !F(("((((((ProcTourProc2.isEndLoop_2>=1)||(ProcTourProc8.isEndLoop_8>=1))||(ProcTourProc14.isEndLoop_14>=1))||(ProcTourProc5.isEndLoop_5>=1))||(ProcTourProc11.isEndLoop_11>=1))||(ProcTourProc17.isEndLoop_17>=1))" U "((((Process0.CS_0>=1)&&(ProcBool1.wantSection_1>=1))||((Process1.CS_1>=1)&&(ProcBool3.wantSection_3>=1)))||((Process2.CS_2>=1)&&(ProcBool5.wantSection_5>=1)))") U ("(((((((((((((((((((ProcBool0.wantSection_0>=1)&&(ProcTourProc0.testAlone_0>=1))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc1.testAlone_1>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc2.testAlone_2>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc6.testAlone_6>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc7.testAlone_7>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc8.testAlone_8>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc12.testAlone_12>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc13.testAlone_13>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc14.testAlone_14>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc3.testAlone_3>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc4.testAlone_4>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc5.testAlone_5>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc9.testAlone_9>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc10.testAlone_10>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc11.testAlone_11>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc15.testAlone_15>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc16.testAlone_16>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc17.testAlone_17>=1)))" U "(((((((((((((ProcTour0.testTurn_0>=1)&&(TourProc1.turn_1>=1))||((ProcTour0.testTurn_0>=1)&&(TourProc2.turn_2>=1)))||((ProcTour2.testTurn_2>=1)&&(TourProc0.turn_0>=1)))||((ProcTour2.testTurn_2>=1)&&(TourProc2.turn_2>=1)))||((ProcTour4.testTurn_4>=1)&&(TourProc0.turn_0>=1)))||((ProcTour4.testTurn_4>=1)&&(TourProc1.turn_1>=1)))||((ProcTour1.testTurn_1>=1)&&(TourProc4.turn_4>=1)))||((ProcTour1.testTurn_1>=1)&&(TourProc5.turn_5>=1)))||((ProcTour3.testTurn_3>=1)&&(TourProc3.turn_3>=1)))||((ProcTour3.testTurn_3>=1)&&(TourProc5.turn_5>=1)))||((ProcTour5.testTurn_5>=1)&&(TourProc3.turn_3>=1)))||((ProcTour5.testTurn_5>=1)&&(TourProc4.turn_4>=1)))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
51 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,2.51964,111712,1,0,225246,256,2123,241750,97,471,676457
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((F(X("(((((((((((((((((((ProcTourProc0.testAlone_0>=1)&&(ProcBool1.wantSection_1>=1))||((ProcTourProc1.testAlone_1>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc2.testAlone_2>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc6.testAlone_6>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc7.testAlone_7>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc8.testAlone_8>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc12.testAlone_12>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc13.testAlone_13>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc14.testAlone_14>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc3.testAlone_3>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc4.testAlone_4>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc5.testAlone_5>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc9.testAlone_9>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc10.testAlone_10>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc11.testAlone_11>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc15.testAlone_15>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc16.testAlone_16>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc17.testAlone_17>=1)&&(ProcBool5.wantSection_5>=1)))")))U(("(((((((TourProc0.turn_0>=1)&&(ProcTour0.testTurn_0>=1))||((TourProc1.turn_1>=1)&&(ProcTour2.testTurn_2>=1)))||((TourProc2.turn_2>=1)&&(ProcTour4.testTurn_4>=1)))||((TourProc3.turn_3>=1)&&(ProcTour1.testTurn_1>=1)))||((TourProc4.turn_4>=1)&&(ProcTour3.testTurn_3>=1)))||((TourProc5.turn_5>=1)&&(ProcTour5.testTurn_5>=1)))")U("(((((((((((((((((((ProcTourProc0.testAlone_0>=1)&&(ProcBool1.wantSection_1>=1))||((ProcTourProc1.testAlone_1>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc2.testAlone_2>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc6.testAlone_6>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc7.testAlone_7>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc8.testAlone_8>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc12.testAlone_12>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc13.testAlone_13>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc14.testAlone_14>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc3.testAlone_3>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc4.testAlone_4>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc5.testAlone_5>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc9.testAlone_9>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc10.testAlone_10>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc11.testAlone_11>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc15.testAlone_15>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc16.testAlone_16>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc17.testAlone_17>=1)&&(ProcBool5.wantSection_5>=1)))")))))
Formula 6 simplified : !F(FX"(((((((((((((((((((ProcTourProc0.testAlone_0>=1)&&(ProcBool1.wantSection_1>=1))||((ProcTourProc1.testAlone_1>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc2.testAlone_2>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc6.testAlone_6>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc7.testAlone_7>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc8.testAlone_8>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc12.testAlone_12>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc13.testAlone_13>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc14.testAlone_14>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc3.testAlone_3>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc4.testAlone_4>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc5.testAlone_5>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc9.testAlone_9>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc10.testAlone_10>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc11.testAlone_11>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc15.testAlone_15>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc16.testAlone_16>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc17.testAlone_17>=1)&&(ProcBool5.wantSection_5>=1)))" U ("(((((((TourProc0.turn_0>=1)&&(ProcTour0.testTurn_0>=1))||((TourProc1.turn_1>=1)&&(ProcTour2.testTurn_2>=1)))||((TourProc2.turn_2>=1)&&(ProcTour4.testTurn_4>=1)))||((TourProc3.turn_3>=1)&&(ProcTour1.testTurn_1>=1)))||((TourProc4.turn_4>=1)&&(ProcTour3.testTurn_3>=1)))||((TourProc5.turn_5>=1)&&(ProcTour5.testTurn_5>=1)))" U "(((((((((((((((((((ProcTourProc0.testAlone_0>=1)&&(ProcBool1.wantSection_1>=1))||((ProcTourProc1.testAlone_1>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc2.testAlone_2>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc6.testAlone_6>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc7.testAlone_7>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc8.testAlone_8>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc12.testAlone_12>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc13.testAlone_13>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc14.testAlone_14>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc3.testAlone_3>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc4.testAlone_4>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc5.testAlone_5>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc9.testAlone_9>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc10.testAlone_10>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc11.testAlone_11>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc15.testAlone_15>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc16.testAlone_16>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc17.testAlone_17>=1)&&(ProcBool5.wantSection_5>=1)))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
95 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.46537,153812,1,0,333336,256,2265,347746,97,480,945231
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G(G(G(G("(((ProcTour1.endTurn_1>=1)||(ProcTour3.endTurn_3>=1))||(ProcTour5.endTurn_5>=1))")))))))
Formula 7 simplified : !FG"(((ProcTour1.endTurn_1>=1)||(ProcTour3.endTurn_3>=1))||(ProcTour5.endTurn_5>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
50 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.96787,173876,1,0,376899,256,2272,397231,97,480,1109619
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((F(X("((((((ProcTourProc0.testIdentity_0>=1)||(ProcTourProc7.testIdentity_7>=1))||(ProcTourProc14.testIdentity_14>=1))||(ProcTourProc3.testIdentity_3>=1))||(ProcTourProc10.testIdentity_10>=1))||(ProcTourProc17.testIdentity_17>=1))")))U(("((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))")U("(((((((((((((ProcTour0.testTurn_0>=1)&&(TourProc1.turn_1>=1))||((ProcTour0.testTurn_0>=1)&&(TourProc2.turn_2>=1)))||((ProcTour2.testTurn_2>=1)&&(TourProc0.turn_0>=1)))||((ProcTour2.testTurn_2>=1)&&(TourProc2.turn_2>=1)))||((ProcTour4.testTurn_4>=1)&&(TourProc0.turn_0>=1)))||((ProcTour4.testTurn_4>=1)&&(TourProc1.turn_1>=1)))||((ProcTour1.testTurn_1>=1)&&(TourProc4.turn_4>=1)))||((ProcTour1.testTurn_1>=1)&&(TourProc5.turn_5>=1)))||((ProcTour3.testTurn_3>=1)&&(TourProc3.turn_3>=1)))||((ProcTour3.testTurn_3>=1)&&(TourProc5.turn_5>=1)))||((ProcTour5.testTurn_5>=1)&&(TourProc3.turn_3>=1)))||((ProcTour5.testTurn_5>=1)&&(TourProc4.turn_4>=1)))")))))
Formula 8 simplified : !X(FX"((((((ProcTourProc0.testIdentity_0>=1)||(ProcTourProc7.testIdentity_7>=1))||(ProcTourProc14.testIdentity_14>=1))||(ProcTourProc3.testIdentity_3>=1))||(ProcTourProc10.testIdentity_10>=1))||(ProcTourProc17.testIdentity_17>=1))" U ("((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))" U "(((((((((((((ProcTour0.testTurn_0>=1)&&(TourProc1.turn_1>=1))||((ProcTour0.testTurn_0>=1)&&(TourProc2.turn_2>=1)))||((ProcTour2.testTurn_2>=1)&&(TourProc0.turn_0>=1)))||((ProcTour2.testTurn_2>=1)&&(TourProc2.turn_2>=1)))||((ProcTour4.testTurn_4>=1)&&(TourProc0.turn_0>=1)))||((ProcTour4.testTurn_4>=1)&&(TourProc1.turn_1>=1)))||((ProcTour1.testTurn_1>=1)&&(TourProc4.turn_4>=1)))||((ProcTour1.testTurn_1>=1)&&(TourProc5.turn_5>=1)))||((ProcTour3.testTurn_3>=1)&&(TourProc3.turn_3>=1)))||((ProcTour3.testTurn_3>=1)&&(TourProc5.turn_5>=1)))||((ProcTour5.testTurn_5>=1)&&(TourProc3.turn_3>=1)))||((ProcTour5.testTurn_5>=1)&&(TourProc4.turn_4>=1)))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 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,4.14103,180424,1,0,391795,256,2417,416563,97,516,1149817
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((((Process0.CS_0>=1)&&(ProcBool1.wantSection_1>=1))||((Process1.CS_1>=1)&&(ProcBool3.wantSection_3>=1)))||((Process2.CS_2>=1)&&(ProcBool5.wantSection_5>=1)))"))
Formula 9 simplified : !"((((Process0.CS_0>=1)&&(ProcBool1.wantSection_1>=1))||((Process1.CS_1>=1)&&(ProcBool3.wantSection_3>=1)))||((Process2.CS_2>=1)&&(ProcBool5.wantSection_5>=1)))"
3 unique states visited
3 strongly connected components in search stack
3 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,4.15173,180688,1,0,392397,256,2430,417286,97,516,1152485
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X("(((((((((((((((((((ProcBool0.wantSection_0>=1)&&(ProcTourProc0.testAlone_0>=1))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc1.testAlone_1>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc2.testAlone_2>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc6.testAlone_6>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc7.testAlone_7>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc8.testAlone_8>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc12.testAlone_12>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc13.testAlone_13>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc14.testAlone_14>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc3.testAlone_3>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc4.testAlone_4>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc5.testAlone_5>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc9.testAlone_9>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc10.testAlone_10>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc11.testAlone_11>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc15.testAlone_15>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc16.testAlone_16>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc17.testAlone_17>=1)))"))U(X(F(X("((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))"))))))
Formula 10 simplified : !(X"(((((((((((((((((((ProcBool0.wantSection_0>=1)&&(ProcTourProc0.testAlone_0>=1))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc1.testAlone_1>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc2.testAlone_2>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc6.testAlone_6>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc7.testAlone_7>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc8.testAlone_8>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc12.testAlone_12>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc13.testAlone_13>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc14.testAlone_14>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc3.testAlone_3>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc4.testAlone_4>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc5.testAlone_5>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc9.testAlone_9>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc10.testAlone_10>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc11.testAlone_11>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc15.testAlone_15>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc16.testAlone_16>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc17.testAlone_17>=1)))" U XFX"((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
28 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,4.43203,185964,1,0,404541,256,2510,429610,97,516,1192144
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X(X(X("((((ProcBool0.wantSection_0>=1)&&(Process0.idle_0>=1))||((ProcBool2.wantSection_2>=1)&&(Process1.idle_1>=1)))||((ProcBool4.wantSection_4>=1)&&(Process2.idle_2>=1)))"))))U(G("(((((((((((((((((((ProcBool0.wantSection_0>=1)&&(ProcTourProc0.testAlone_0>=1))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc1.testAlone_1>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc2.testAlone_2>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc6.testAlone_6>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc7.testAlone_7>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc8.testAlone_8>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc12.testAlone_12>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc13.testAlone_13>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc14.testAlone_14>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc3.testAlone_3>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc4.testAlone_4>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc5.testAlone_5>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc9.testAlone_9>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc10.testAlone_10>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc11.testAlone_11>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc15.testAlone_15>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc16.testAlone_16>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc17.testAlone_17>=1)))"))))
Formula 11 simplified : !(XXX"((((ProcBool0.wantSection_0>=1)&&(Process0.idle_0>=1))||((ProcBool2.wantSection_2>=1)&&(Process1.idle_1>=1)))||((ProcBool4.wantSection_4>=1)&&(Process2.idle_2>=1)))" U G"(((((((((((((((((((ProcBool0.wantSection_0>=1)&&(ProcTourProc0.testAlone_0>=1))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc1.testAlone_1>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc2.testAlone_2>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc6.testAlone_6>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc7.testAlone_7>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc8.testAlone_8>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc12.testAlone_12>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc13.testAlone_13>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc14.testAlone_14>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc3.testAlone_3>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc4.testAlone_4>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc5.testAlone_5>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc9.testAlone_9>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc10.testAlone_10>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc11.testAlone_11>=1)))||((ProcBool0.wantSection_0>=1)&&(ProcTourProc15.testAlone_15>=1)))||((ProcBool2.wantSection_2>=1)&&(ProcTourProc16.testAlone_16>=1)))||((ProcBool4.wantSection_4>=1)&&(ProcTourProc17.testAlone_17>=1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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,4.50812,189300,1,0,410960,256,2606,436310,97,516,1215836
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(((((((((((((((((((ProcTourProc0.testAlone_0>=1)&&(ProcBool1.wantSection_1>=1))||((ProcTourProc1.testAlone_1>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc2.testAlone_2>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc6.testAlone_6>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc7.testAlone_7>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc8.testAlone_8>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc12.testAlone_12>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc13.testAlone_13>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc14.testAlone_14>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc3.testAlone_3>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc4.testAlone_4>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc5.testAlone_5>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc9.testAlone_9>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc10.testAlone_10>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc11.testAlone_11>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc15.testAlone_15>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc16.testAlone_16>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc17.testAlone_17>=1)&&(ProcBool5.wantSection_5>=1)))"))
Formula 12 simplified : !"(((((((((((((((((((ProcTourProc0.testAlone_0>=1)&&(ProcBool1.wantSection_1>=1))||((ProcTourProc1.testAlone_1>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc2.testAlone_2>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc6.testAlone_6>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc7.testAlone_7>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc8.testAlone_8>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc12.testAlone_12>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc13.testAlone_13>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc14.testAlone_14>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc3.testAlone_3>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc4.testAlone_4>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc5.testAlone_5>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc9.testAlone_9>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc10.testAlone_10>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc11.testAlone_11>=1)&&(ProcBool5.wantSection_5>=1)))||((ProcTourProc15.testAlone_15>=1)&&(ProcBool1.wantSection_1>=1)))||((ProcTourProc16.testAlone_16>=1)&&(ProcBool3.wantSection_3>=1)))||((ProcTourProc17.testAlone_17>=1)&&(ProcBool5.wantSection_5>=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,4.5105,189564,1,0,410960,256,2606,436310,97,516,1215837
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(F(X("((((Process0.CS_0>=1)&&(ProcBool1.wantSection_1>=1))||((Process1.CS_1>=1)&&(ProcBool3.wantSection_3>=1)))||((Process2.CS_2>=1)&&(ProcBool5.wantSection_5>=1)))")))))
Formula 13 simplified : !XFX"((((Process0.CS_0>=1)&&(ProcBool1.wantSection_1>=1))||((Process1.CS_1>=1)&&(ProcBool3.wantSection_3>=1)))||((Process2.CS_2>=1)&&(ProcBool5.wantSection_5>=1)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
41 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,4.91891,196956,1,0,429486,256,2675,456605,97,516,1265284
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))"))
Formula 14 simplified : !"((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=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,4.9202,197220,1,0,429486,256,2675,456605,97,516,1265329
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F("((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))"))U("((((Process0.CS_0>=1)&&(ProcBool1.wantSection_1>=1))||((Process1.CS_1>=1)&&(ProcBool3.wantSection_3>=1)))||((Process2.CS_2>=1)&&(ProcBool5.wantSection_5>=1)))")))
Formula 15 simplified : !(F"((((((((((((ProcTourProc1.testIdentity_1>=1)||(ProcTourProc2.testIdentity_2>=1))||(ProcTourProc6.testIdentity_6>=1))||(ProcTourProc8.testIdentity_8>=1))||(ProcTourProc12.testIdentity_12>=1))||(ProcTourProc13.testIdentity_13>=1))||(ProcTourProc4.testIdentity_4>=1))||(ProcTourProc5.testIdentity_5>=1))||(ProcTourProc9.testIdentity_9>=1))||(ProcTourProc11.testIdentity_11>=1))||(ProcTourProc15.testIdentity_15>=1))||(ProcTourProc16.testIdentity_16>=1))" U "((((Process0.CS_0>=1)&&(ProcBool1.wantSection_1>=1))||((Process1.CS_1>=1)&&(ProcBool3.wantSection_3>=1)))||((Process2.CS_2>=1)&&(ProcBool5.wantSection_5>=1)))")
33 unique states visited
33 strongly connected components in search stack
33 transitions explored
33 items max in DFS search stack
103 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.95623,238664,1,0,522628,256,2678,581153,97,597,1519658
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Peterson-COL-2-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]
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527489052910

--------------------
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/ -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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 6:30:43 AM 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/, -smt]
May 28, 2018 6:30:43 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 6:30:43 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2018 6:30:44 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 806 ms
May 28, 2018 6:30:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 places.
May 28, 2018 6:30:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 6:30:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
ProcTour->askForSection,testTurn,endTurn,
TourProc->turn,
Process->idle,CS,

May 28, 2018 6:30:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 14 transitions.
May 28, 2018 6:30:44 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 6:30:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
May 28, 2018 6:30:44 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 6:30:44 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 6:30:44 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 21.0 instantiations of transitions. Total transitions/syncs built is 141
May 28, 2018 6:30:44 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 45 ms
May 28, 2018 6:30:44 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays idle, wantSection, askForSection, turn, testTurn, beginLoop, endTurn, CS, testIdentity, testAlone, isEndLoop to variables to allow decomposition.
May 28, 2018 6:30:44 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 90 redundant transitions.
May 28, 2018 6:30:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
May 28, 2018 6:30:44 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
May 28, 2018 6:30:45 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 138 transitions.
May 28, 2018 6:30:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 21 ms
May 28, 2018 6:30:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 108 variables to be positive in 177 ms
May 28, 2018 6:30:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 138 transitions.
May 28, 2018 6:30:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/138 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:30:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:30:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 138 transitions.
May 28, 2018 6:30:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:30:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 138 transitions.
May 28, 2018 6:30:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(22/138) took 1402 ms. Total solver calls (SAT/UNSAT): 1155(70/1085)
May 28, 2018 6:30:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(121/138) took 4407 ms. Total solver calls (SAT/UNSAT): 3357(174/3183)
May 28, 2018 6:30:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 4609 ms. Total solver calls (SAT/UNSAT): 3429(174/3255)
May 28, 2018 6:30:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 138 transitions.
May 28, 2018 6:30:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 12(0/12)
May 28, 2018 6:30:51 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 6726ms 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="Peterson-COL-2"
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/Peterson-COL-2.tgz
mv Peterson-COL-2 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 itstools"
echo " Input is Peterson-COL-2, 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 r260-csrt-152732585400148"
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 ;