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 384K
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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 5.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 98K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732586000160
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527504664698

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/graph8840612351545180768.txt, -o, /tmp/graph8840612351545180768.bin, -w, /tmp/graph8840612351545180768.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/graph8840612351545180768.bin, -l, -1, -v, -w, /tmp/graph8840612351545180768.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 : !((G(G(G(X(G("(((i7.u7.EndTurn_2_1>=1)||(i9.u34.EndTurn_1_1>=1))||(i0.u33.EndTurn_0_1>=1))")))))))
Formula 0 simplified : !GXG"(((i7.u7.EndTurn_2_1>=1)||(i9.u34.EndTurn_1_1>=1))||(i0.u33.EndTurn_0_1>=1))"
built 39 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 12 ordering constraints for composite.
built 21 ordering constraints for composite.
built 15 ordering constraints for composite.
built 19 ordering constraints for composite.
built 10 ordering constraints for composite.
built 21 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions NotAlone_0_2_0, NotAlone_2_1_0, NotAlone_1_2_0, NotAlone_2_1_1, NotAlone_0_2_1, NotAlone_1_2_1, UpdateTurn_1_0_0, UpdateTurn_2_1_0, UpdateTurn_2_0_0, UpdateTurn_0_1_0, UpdateTurn_0_2_1, UpdateTurn_2_1_1, UpdateTurn_2_2_1, UpdateTurn_2_0_1, UpdateTurn_0_1_1, UpdateTurn_1_2_0, UpdateTurn_0_2_0, UpdateTurn_0_0_1, BecomeIdle_2, BecomeIdle_1, BecomeIdle_0, i0.u4.EndLoop_0_0, i2.u21.UpdateTurn_2_2_0, i2.u30.EndLoop_2_0, i4.u5.EndLoop_1_0, i4.u37.UpdateTurn_1_1_0, i5.u18.UpdateTurn_0_0_0, i9.u35.UpdateTurn_1_2_1, i9.u35.UpdateTurn_1_0_1, i9.u35.UpdateTurn_1_1_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/30/126
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 120
// Phase 1: matrix 120 rows 102 cols
invariant :i1:u3:IsEndLoop_1_1_1 + i1:u3:BeginLoop_1_1_2 + i1:u3:TestIdentity_1_1_1 + i1:u12:IsEndLoop_1_1_0 + i1:u12:BeginLoop_1_1_1 + i1:u26:TestAlone_1_1_2 + i1:u26:TestIdentity_1_1_2 + i4:u5:IsEndLoop_1_0_2 + i4:u5:EndTurn_1_0 + i4:u20:BeginLoop_1_0_0 + i4:u20:TestAlone_1_0_0 + i4:u20:TestIdentity_1_0_0 + i4:u37:TestTurn_1_0 + i4:u37:AskForSection_1_0 + i6:u32:Idle_1 + i8:u9:IsEndLoop_1_0_0 + i8:u9:BeginLoop_1_0_1 + i8:u13:IsEndLoop_1_0_1 + i8:u13:BeginLoop_1_0_2 + i8:u13:TestIdentity_1_0_1 + i8:u31:TestAlone_1_0_2 + i8:u31:TestIdentity_1_0_2 + i9:u8:BeginLoop_1_1_0 + i9:u8:TestAlone_1_1_0 + i9:u8:TestIdentity_1_1_0 + i9:u34:IsEndLoop_1_1_2 + i9:u34:EndTurn_1_1 + i9:u34:CS_1 + i9:u35:TestTurn_1_1 + i9:u35:AskForSection_1_1 = 1
invariant :i9:u35:Turn_1_2 + i9:u35:Turn_1_0 + i9:u35:Turn_1_1 = 1
invariant :i0:u4:IsEndLoop_0_0_2 + i0:u4:EndTurn_0_0 + i0:u22:TestTurn_0_1 + i0:u22:AskForSection_0_1 + i0:u33:IsEndLoop_0_1_2 + i0:u33:EndTurn_0_1 + i0:u33:CS_0 + i3:u0:IsEndLoop_0_1_0 + i3:u0:BeginLoop_0_1_1 + i3:u17:TestAlone_0_1_1 + i3:u17:TestIdentity_0_1_1 + i3:u23:BeginLoop_0_1_0 + i3:u23:TestIdentity_0_1_0 + i5:u18:TestTurn_0_0 + i5:u18:AskForSection_0_0 + i5:u19:BeginLoop_0_0_0 + i5:u19:TestIdentity_0_0_0 + i5:u11:IsEndLoop_0_0_0 + i5:u11:BeginLoop_0_0_1 + i5:u25:TestAlone_0_0_1 + i5:u25:TestIdentity_0_0_1 + i5:u28:IsEndLoop_0_0_1 + i5:u28:BeginLoop_0_0_2 + i5:u28:TestAlone_0_0_2 + i5:u28:TestIdentity_0_0_2 + i6:u27:IsEndLoop_0_1_1 + i6:u27:BeginLoop_0_1_2 + i6:u27:TestAlone_0_1_2 + i6:u27:TestIdentity_0_1_2 + i8:u9:WantSection_0_F = 1
invariant :i6:u32:WantSection_1_T + i6:u32:Idle_1 = 1
invariant :i7:u15:Idle_0 + -1'i8:u9:WantSection_0_F = 0
invariant :i6:u32:WantSection_1_F + -1'i6:u32:Idle_1 = 0
invariant :i0:u14:WantSection_2_F + -1'i0:u14:Idle_2 = 0
invariant :i2:u21:Turn_0_2 + i4:u37:Turn_0_1 + i5:u18:Turn_0_0 = 1
invariant :i0:u14:Idle_2 + i2:u10:IsEndLoop_2_0_0 + i2:u10:BeginLoop_2_0_1 + i2:u10:TestAlone_2_0_1 + i2:u10:TestIdentity_2_0_1 + i2:u16:BeginLoop_2_0_0 + i2:u16:TestAlone_2_0_0 + i2:u16:TestIdentity_2_0_0 + i2:u21:TestTurn_2_0 + i2:u21:AskForSection_2_0 + i2:u2:IsEndLoop_2_0_1 + i2:u2:BeginLoop_2_0_2 + i2:u2:TestIdentity_2_0_2 + i2:u30:IsEndLoop_2_0_2 + i2:u30:EndTurn_2_0 + i7:u6:IsEndLoop_2_1_1 + i7:u6:BeginLoop_2_1_2 + i7:u6:TestIdentity_2_1_2 + i7:u7:IsEndLoop_2_1_2 + i7:u7:EndTurn_2_1 + i7:u7:CS_2 + i7:u24:BeginLoop_2_1_0 + i7:u24:TestAlone_2_1_0 + i7:u24:TestIdentity_2_1_0 + i7:u36:TestTurn_2_1 + i7:u36:AskForSection_2_1 + i7:u1:IsEndLoop_2_1_0 + i7:u1:BeginLoop_2_1_1 + i7:u29:TestAlone_2_1_1 + i7:u29:TestIdentity_2_1_1 = 1
invariant :i0:u14:WantSection_2_T + i0:u14:Idle_2 = 1
invariant :i7:u15:WantSection_0_T + i8:u9:WantSection_0_F = 1
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
25 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.272076,24028,1,0,14221,437,1777,24317,263,1452,49887
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((i6.u32.Idle_1>=1)&&(i6.u32.WantSection_1_F>=1))||((i0.u14.WantSection_2_F>=1)&&(i0.u14.Idle_2>=1)))||((i7.u15.Idle_0>=1)&&(i8.u9.WantSection_0_F>=1)))"))
Formula 1 simplified : !"((((i6.u32.Idle_1>=1)&&(i6.u32.WantSection_1_F>=1))||((i0.u14.WantSection_2_F>=1)&&(i0.u14.Idle_2>=1)))||((i7.u15.Idle_0>=1)&&(i8.u9.WantSection_0_F>=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.273191,24728,1,0,14221,437,1802,24317,266,1452,49913
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(X(X("(((((((i4.u37.Turn_0_1>=1)&&(i4.u37.TestTurn_1_0>=1))||((i2.u21.Turn_0_2>=1)&&(i2.u21.TestTurn_2_0>=1)))||((i5.u18.Turn_0_0>=1)&&(i5.u18.TestTurn_0_0>=1)))||((i7.u36.TestTurn_2_1>=1)&&(i9.u35.Turn_1_2>=1)))||((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_0>=1)))||((i9.u35.TestTurn_1_1>=1)&&(i9.u35.Turn_1_1>=1)))"))))U((X("((((((((((((((((((i2.u10.BeginLoop_2_0_1>=1)||(i5.u28.BeginLoop_0_0_2>=1))||(i8.u13.BeginLoop_1_0_2>=1))||(i2.u2.BeginLoop_2_0_2>=1))||(i3.u23.BeginLoop_0_1_0>=1))||(i9.u8.BeginLoop_1_1_0>=1))||(i7.u24.BeginLoop_2_1_0>=1))||(i3.u0.BeginLoop_0_1_1>=1))||(i5.u19.BeginLoop_0_0_0>=1))||(i4.u20.BeginLoop_1_0_0>=1))||(i2.u16.BeginLoop_2_0_0>=1))||(i5.u11.BeginLoop_0_0_1>=1))||(i8.u9.BeginLoop_1_0_1>=1))||(i1.u3.BeginLoop_1_1_2>=1))||(i6.u27.BeginLoop_0_1_2>=1))||(i7.u1.BeginLoop_2_1_1>=1))||(i1.u12.BeginLoop_1_1_1>=1))||(i7.u6.BeginLoop_2_1_2>=1))"))U(F("((((((((((((((((((i2.u10.BeginLoop_2_0_1>=1)||(i5.u28.BeginLoop_0_0_2>=1))||(i8.u13.BeginLoop_1_0_2>=1))||(i2.u2.BeginLoop_2_0_2>=1))||(i3.u23.BeginLoop_0_1_0>=1))||(i9.u8.BeginLoop_1_1_0>=1))||(i7.u24.BeginLoop_2_1_0>=1))||(i3.u0.BeginLoop_0_1_1>=1))||(i5.u19.BeginLoop_0_0_0>=1))||(i4.u20.BeginLoop_1_0_0>=1))||(i2.u16.BeginLoop_2_0_0>=1))||(i5.u11.BeginLoop_0_0_1>=1))||(i8.u9.BeginLoop_1_0_1>=1))||(i1.u3.BeginLoop_1_1_2>=1))||(i6.u27.BeginLoop_0_1_2>=1))||(i7.u1.BeginLoop_2_1_1>=1))||(i1.u12.BeginLoop_1_1_1>=1))||(i7.u6.BeginLoop_2_1_2>=1))")))))
Formula 2 simplified : !(GXX"(((((((i4.u37.Turn_0_1>=1)&&(i4.u37.TestTurn_1_0>=1))||((i2.u21.Turn_0_2>=1)&&(i2.u21.TestTurn_2_0>=1)))||((i5.u18.Turn_0_0>=1)&&(i5.u18.TestTurn_0_0>=1)))||((i7.u36.TestTurn_2_1>=1)&&(i9.u35.Turn_1_2>=1)))||((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_0>=1)))||((i9.u35.TestTurn_1_1>=1)&&(i9.u35.Turn_1_1>=1)))" U (X"((((((((((((((((((i2.u10.BeginLoop_2_0_1>=1)||(i5.u28.BeginLoop_0_0_2>=1))||(i8.u13.BeginLoop_1_0_2>=1))||(i2.u2.BeginLoop_2_0_2>=1))||(i3.u23.BeginLoop_0_1_0>=1))||(i9.u8.BeginLoop_1_1_0>=1))||(i7.u24.BeginLoop_2_1_0>=1))||(i3.u0.BeginLoop_0_1_1>=1))||(i5.u19.BeginLoop_0_0_0>=1))||(i4.u20.BeginLoop_1_0_0>=1))||(i2.u16.BeginLoop_2_0_0>=1))||(i5.u11.BeginLoop_0_0_1>=1))||(i8.u9.BeginLoop_1_0_1>=1))||(i1.u3.BeginLoop_1_1_2>=1))||(i6.u27.BeginLoop_0_1_2>=1))||(i7.u1.BeginLoop_2_1_1>=1))||(i1.u12.BeginLoop_1_1_1>=1))||(i7.u6.BeginLoop_2_1_2>=1))" U F"((((((((((((((((((i2.u10.BeginLoop_2_0_1>=1)||(i5.u28.BeginLoop_0_0_2>=1))||(i8.u13.BeginLoop_1_0_2>=1))||(i2.u2.BeginLoop_2_0_2>=1))||(i3.u23.BeginLoop_0_1_0>=1))||(i9.u8.BeginLoop_1_1_0>=1))||(i7.u24.BeginLoop_2_1_0>=1))||(i3.u0.BeginLoop_0_1_1>=1))||(i5.u19.BeginLoop_0_0_0>=1))||(i4.u20.BeginLoop_1_0_0>=1))||(i2.u16.BeginLoop_2_0_0>=1))||(i5.u11.BeginLoop_0_0_1>=1))||(i8.u9.BeginLoop_1_0_1>=1))||(i1.u3.BeginLoop_1_1_2>=1))||(i6.u27.BeginLoop_0_1_2>=1))||(i7.u1.BeginLoop_2_1_1>=1))||(i1.u12.BeginLoop_1_1_1>=1))||(i7.u6.BeginLoop_2_1_2>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 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.314588,26396,1,0,17989,444,1887,27826,266,1472,61601
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("((((((((((((i2.u16.TestIdentity_2_0_0>=1)||(i4.u20.TestIdentity_1_0_0>=1))||(i2.u10.TestIdentity_2_0_1>=1))||(i5.u25.TestIdentity_0_0_1>=1))||(i3.u17.TestIdentity_0_1_1>=1))||(i7.u29.TestIdentity_2_1_1>=1))||(i6.u27.TestIdentity_0_1_2>=1))||(i1.u26.TestIdentity_1_1_2>=1))||(i5.u28.TestIdentity_0_0_2>=1))||(i8.u31.TestIdentity_1_0_2>=1))||(i9.u8.TestIdentity_1_1_0>=1))||(i7.u24.TestIdentity_2_1_0>=1))")U("(((i7.u7.EndTurn_2_1>=1)||(i9.u34.EndTurn_1_1>=1))||(i0.u33.EndTurn_0_1>=1))"))U(G(F(X("((((((((((((i5.u11.IsEndLoop_0_0_0>=1)||(i7.u1.IsEndLoop_2_1_0>=1))||(i1.u12.IsEndLoop_1_1_0>=1))||(i3.u0.IsEndLoop_0_1_0>=1))||(i2.u2.IsEndLoop_2_0_1>=1))||(i8.u13.IsEndLoop_1_0_1>=1))||(i5.u28.IsEndLoop_0_0_1>=1))||(i2.u10.IsEndLoop_2_0_0>=1))||(i8.u9.IsEndLoop_1_0_0>=1))||(i7.u6.IsEndLoop_2_1_1>=1))||(i1.u3.IsEndLoop_1_1_1>=1))||(i6.u27.IsEndLoop_0_1_1>=1))"))))))
Formula 3 simplified : !(("((((((((((((i2.u16.TestIdentity_2_0_0>=1)||(i4.u20.TestIdentity_1_0_0>=1))||(i2.u10.TestIdentity_2_0_1>=1))||(i5.u25.TestIdentity_0_0_1>=1))||(i3.u17.TestIdentity_0_1_1>=1))||(i7.u29.TestIdentity_2_1_1>=1))||(i6.u27.TestIdentity_0_1_2>=1))||(i1.u26.TestIdentity_1_1_2>=1))||(i5.u28.TestIdentity_0_0_2>=1))||(i8.u31.TestIdentity_1_0_2>=1))||(i9.u8.TestIdentity_1_1_0>=1))||(i7.u24.TestIdentity_2_1_0>=1))" U "(((i7.u7.EndTurn_2_1>=1)||(i9.u34.EndTurn_1_1>=1))||(i0.u33.EndTurn_0_1>=1))") U GFX"((((((((((((i5.u11.IsEndLoop_0_0_0>=1)||(i7.u1.IsEndLoop_2_1_0>=1))||(i1.u12.IsEndLoop_1_1_0>=1))||(i3.u0.IsEndLoop_0_1_0>=1))||(i2.u2.IsEndLoop_2_0_1>=1))||(i8.u13.IsEndLoop_1_0_1>=1))||(i5.u28.IsEndLoop_0_0_1>=1))||(i2.u10.IsEndLoop_2_0_0>=1))||(i8.u9.IsEndLoop_1_0_0>=1))||(i7.u6.IsEndLoop_2_1_1>=1))||(i1.u3.IsEndLoop_1_1_1>=1))||(i6.u27.IsEndLoop_0_1_1>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
23 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.553248,36812,1,0,38172,453,1971,60158,270,1575,106047
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("(((i7.u7.EndTurn_2_1>=1)||(i9.u34.EndTurn_1_1>=1))||(i0.u33.EndTurn_0_1>=1))")U(G(F(G("(((i0.u4.EndTurn_0_0>=1)||(i4.u5.EndTurn_1_0>=1))||(i2.u30.EndTurn_2_0>=1))"))))))
Formula 4 simplified : !("(((i7.u7.EndTurn_2_1>=1)||(i9.u34.EndTurn_1_1>=1))||(i0.u33.EndTurn_0_1>=1))" U GFG"(((i0.u4.EndTurn_0_0>=1)||(i4.u5.EndTurn_1_0>=1))||(i2.u30.EndTurn_2_0>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
63 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.18172,58620,1,0,87053,466,1999,121187,270,1678,202685
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((("((((((i7.u7.IsEndLoop_2_1_2>=1)||(i0.u33.IsEndLoop_0_1_2>=1))||(i9.u34.IsEndLoop_1_1_2>=1))||(i4.u5.IsEndLoop_1_0_2>=1))||(i2.u30.IsEndLoop_2_0_2>=1))||(i0.u4.IsEndLoop_0_0_2>=1))")U("((((i7.u7.CS_2>=1)&&(i0.u14.WantSection_2_T>=1))||((i9.u34.CS_1>=1)&&(i6.u32.WantSection_1_T>=1)))||((i0.u33.CS_0>=1)&&(i7.u15.WantSection_0_T>=1)))"))U(("(((((((((((((i0.u14.WantSection_2_F>=1)&&(i5.u28.TestAlone_0_0_2>=1))||((i6.u32.WantSection_1_F>=1)&&(i2.u10.TestAlone_2_0_1>=1)))||((i5.u25.TestAlone_0_0_1>=1)&&(i6.u32.WantSection_1_F>=1)))||((i8.u9.WantSection_0_F>=1)&&(i2.u16.TestAlone_2_0_0>=1)))||((i4.u20.TestAlone_1_0_0>=1)&&(i8.u9.WantSection_0_F>=1)))||((i9.u8.TestAlone_1_1_0>=1)&&(i8.u9.WantSection_0_F>=1)))||((i0.u14.WantSection_2_F>=1)&&(i8.u31.TestAlone_1_0_2>=1)))||((i3.u17.TestAlone_0_1_1>=1)&&(i6.u32.WantSection_1_F>=1)))||((i8.u9.WantSection_0_F>=1)&&(i7.u24.TestAlone_2_1_0>=1)))||((i6.u27.TestAlone_0_1_2>=1)&&(i0.u14.WantSection_2_F>=1)))||((i6.u32.WantSection_1_F>=1)&&(i7.u29.TestAlone_2_1_1>=1)))||((i0.u14.WantSection_2_F>=1)&&(i1.u26.TestAlone_1_1_2>=1)))")U("(((((((((((((i9.u35.TestTurn_1_1>=1)&&(i9.u35.Turn_1_0>=1))||((i4.u37.TestTurn_1_0>=1)&&(i2.u21.Turn_0_2>=1)))||((i5.u18.TestTurn_0_0>=1)&&(i2.u21.Turn_0_2>=1)))||((i2.u21.TestTurn_2_0>=1)&&(i4.u37.Turn_0_1>=1)))||((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_2>=1)))||((i9.u35.Turn_1_1>=1)&&(i7.u36.TestTurn_2_1>=1)))||((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_1>=1)))||((i7.u36.TestTurn_2_1>=1)&&(i9.u35.Turn_1_0>=1)))||((i5.u18.TestTurn_0_0>=1)&&(i4.u37.Turn_0_1>=1)))||((i5.u18.Turn_0_0>=1)&&(i2.u21.TestTurn_2_0>=1)))||((i4.u37.TestTurn_1_0>=1)&&(i5.u18.Turn_0_0>=1)))||((i9.u35.TestTurn_1_1>=1)&&(i9.u35.Turn_1_2>=1)))")))))
Formula 5 simplified : !F(("((((((i7.u7.IsEndLoop_2_1_2>=1)||(i0.u33.IsEndLoop_0_1_2>=1))||(i9.u34.IsEndLoop_1_1_2>=1))||(i4.u5.IsEndLoop_1_0_2>=1))||(i2.u30.IsEndLoop_2_0_2>=1))||(i0.u4.IsEndLoop_0_0_2>=1))" U "((((i7.u7.CS_2>=1)&&(i0.u14.WantSection_2_T>=1))||((i9.u34.CS_1>=1)&&(i6.u32.WantSection_1_T>=1)))||((i0.u33.CS_0>=1)&&(i7.u15.WantSection_0_T>=1)))") U ("(((((((((((((i0.u14.WantSection_2_F>=1)&&(i5.u28.TestAlone_0_0_2>=1))||((i6.u32.WantSection_1_F>=1)&&(i2.u10.TestAlone_2_0_1>=1)))||((i5.u25.TestAlone_0_0_1>=1)&&(i6.u32.WantSection_1_F>=1)))||((i8.u9.WantSection_0_F>=1)&&(i2.u16.TestAlone_2_0_0>=1)))||((i4.u20.TestAlone_1_0_0>=1)&&(i8.u9.WantSection_0_F>=1)))||((i9.u8.TestAlone_1_1_0>=1)&&(i8.u9.WantSection_0_F>=1)))||((i0.u14.WantSection_2_F>=1)&&(i8.u31.TestAlone_1_0_2>=1)))||((i3.u17.TestAlone_0_1_1>=1)&&(i6.u32.WantSection_1_F>=1)))||((i8.u9.WantSection_0_F>=1)&&(i7.u24.TestAlone_2_1_0>=1)))||((i6.u27.TestAlone_0_1_2>=1)&&(i0.u14.WantSection_2_F>=1)))||((i6.u32.WantSection_1_F>=1)&&(i7.u29.TestAlone_2_1_1>=1)))||((i0.u14.WantSection_2_F>=1)&&(i1.u26.TestAlone_1_1_2>=1)))" U "(((((((((((((i9.u35.TestTurn_1_1>=1)&&(i9.u35.Turn_1_0>=1))||((i4.u37.TestTurn_1_0>=1)&&(i2.u21.Turn_0_2>=1)))||((i5.u18.TestTurn_0_0>=1)&&(i2.u21.Turn_0_2>=1)))||((i2.u21.TestTurn_2_0>=1)&&(i4.u37.Turn_0_1>=1)))||((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_2>=1)))||((i9.u35.Turn_1_1>=1)&&(i7.u36.TestTurn_2_1>=1)))||((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_1>=1)))||((i7.u36.TestTurn_2_1>=1)&&(i9.u35.Turn_1_0>=1)))||((i5.u18.TestTurn_0_0>=1)&&(i4.u37.Turn_0_1>=1)))||((i5.u18.Turn_0_0>=1)&&(i2.u21.TestTurn_2_0>=1)))||((i4.u37.TestTurn_1_0>=1)&&(i5.u18.Turn_0_0>=1)))||((i9.u35.TestTurn_1_1>=1)&&(i9.u35.Turn_1_2>=1)))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
37 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.54107,71024,1,0,112972,471,2095,150043,274,1705,263339
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((F(X("(((((((((((((i6.u32.WantSection_1_T>=1)&&(i5.u25.TestAlone_0_0_1>=1))||((i2.u16.TestAlone_2_0_0>=1)&&(i7.u15.WantSection_0_T>=1)))||((i5.u28.TestAlone_0_0_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i2.u10.TestAlone_2_0_1>=1)&&(i6.u32.WantSection_1_T>=1)))||((i7.u15.WantSection_0_T>=1)&&(i9.u8.TestAlone_1_1_0>=1)))||((i8.u31.TestAlone_1_0_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i6.u32.WantSection_1_T>=1)&&(i3.u17.TestAlone_0_1_1>=1)))||((i7.u24.TestAlone_2_1_0>=1)&&(i7.u15.WantSection_0_T>=1)))||((i7.u15.WantSection_0_T>=1)&&(i4.u20.TestAlone_1_0_0>=1)))||((i6.u32.WantSection_1_T>=1)&&(i7.u29.TestAlone_2_1_1>=1)))||((i6.u27.TestAlone_0_1_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i0.u14.WantSection_2_T>=1)&&(i1.u26.TestAlone_1_1_2>=1)))")))U(("(((((((i4.u37.Turn_0_1>=1)&&(i4.u37.TestTurn_1_0>=1))||((i2.u21.Turn_0_2>=1)&&(i2.u21.TestTurn_2_0>=1)))||((i5.u18.Turn_0_0>=1)&&(i5.u18.TestTurn_0_0>=1)))||((i7.u36.TestTurn_2_1>=1)&&(i9.u35.Turn_1_2>=1)))||((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_0>=1)))||((i9.u35.TestTurn_1_1>=1)&&(i9.u35.Turn_1_1>=1)))")U("(((((((((((((i6.u32.WantSection_1_T>=1)&&(i5.u25.TestAlone_0_0_1>=1))||((i2.u16.TestAlone_2_0_0>=1)&&(i7.u15.WantSection_0_T>=1)))||((i5.u28.TestAlone_0_0_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i2.u10.TestAlone_2_0_1>=1)&&(i6.u32.WantSection_1_T>=1)))||((i7.u15.WantSection_0_T>=1)&&(i9.u8.TestAlone_1_1_0>=1)))||((i8.u31.TestAlone_1_0_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i6.u32.WantSection_1_T>=1)&&(i3.u17.TestAlone_0_1_1>=1)))||((i7.u24.TestAlone_2_1_0>=1)&&(i7.u15.WantSection_0_T>=1)))||((i7.u15.WantSection_0_T>=1)&&(i4.u20.TestAlone_1_0_0>=1)))||((i6.u32.WantSection_1_T>=1)&&(i7.u29.TestAlone_2_1_1>=1)))||((i6.u27.TestAlone_0_1_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i0.u14.WantSection_2_T>=1)&&(i1.u26.TestAlone_1_1_2>=1)))")))))
Formula 6 simplified : !F(FX"(((((((((((((i6.u32.WantSection_1_T>=1)&&(i5.u25.TestAlone_0_0_1>=1))||((i2.u16.TestAlone_2_0_0>=1)&&(i7.u15.WantSection_0_T>=1)))||((i5.u28.TestAlone_0_0_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i2.u10.TestAlone_2_0_1>=1)&&(i6.u32.WantSection_1_T>=1)))||((i7.u15.WantSection_0_T>=1)&&(i9.u8.TestAlone_1_1_0>=1)))||((i8.u31.TestAlone_1_0_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i6.u32.WantSection_1_T>=1)&&(i3.u17.TestAlone_0_1_1>=1)))||((i7.u24.TestAlone_2_1_0>=1)&&(i7.u15.WantSection_0_T>=1)))||((i7.u15.WantSection_0_T>=1)&&(i4.u20.TestAlone_1_0_0>=1)))||((i6.u32.WantSection_1_T>=1)&&(i7.u29.TestAlone_2_1_1>=1)))||((i6.u27.TestAlone_0_1_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i0.u14.WantSection_2_T>=1)&&(i1.u26.TestAlone_1_1_2>=1)))" U ("(((((((i4.u37.Turn_0_1>=1)&&(i4.u37.TestTurn_1_0>=1))||((i2.u21.Turn_0_2>=1)&&(i2.u21.TestTurn_2_0>=1)))||((i5.u18.Turn_0_0>=1)&&(i5.u18.TestTurn_0_0>=1)))||((i7.u36.TestTurn_2_1>=1)&&(i9.u35.Turn_1_2>=1)))||((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_0>=1)))||((i9.u35.TestTurn_1_1>=1)&&(i9.u35.Turn_1_1>=1)))" U "(((((((((((((i6.u32.WantSection_1_T>=1)&&(i5.u25.TestAlone_0_0_1>=1))||((i2.u16.TestAlone_2_0_0>=1)&&(i7.u15.WantSection_0_T>=1)))||((i5.u28.TestAlone_0_0_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i2.u10.TestAlone_2_0_1>=1)&&(i6.u32.WantSection_1_T>=1)))||((i7.u15.WantSection_0_T>=1)&&(i9.u8.TestAlone_1_1_0>=1)))||((i8.u31.TestAlone_1_0_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i6.u32.WantSection_1_T>=1)&&(i3.u17.TestAlone_0_1_1>=1)))||((i7.u24.TestAlone_2_1_0>=1)&&(i7.u15.WantSection_0_T>=1)))||((i7.u15.WantSection_0_T>=1)&&(i4.u20.TestAlone_1_0_0>=1)))||((i6.u32.WantSection_1_T>=1)&&(i7.u29.TestAlone_2_1_1>=1)))||((i6.u27.TestAlone_0_1_2>=1)&&(i0.u14.WantSection_2_T>=1)))||((i0.u14.WantSection_2_T>=1)&&(i1.u26.TestAlone_1_1_2>=1)))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
39 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.94374,86600,1,0,146425,472,2176,189794,274,1708,339378
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G(G(G(G("(((i7.u7.EndTurn_2_1>=1)||(i9.u34.EndTurn_1_1>=1))||(i0.u33.EndTurn_0_1>=1))")))))))
Formula 7 simplified : !FG"(((i7.u7.EndTurn_2_1>=1)||(i9.u34.EndTurn_1_1>=1))||(i0.u33.EndTurn_0_1>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,2.35315,97688,1,0,169205,473,2183,213781,274,1715,389653
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(i7.u6.TestIdentity_2_1_2>=1)"))
Formula 8 simplified : !"(i7.u6.TestIdentity_2_1_2>=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,2.35732,97688,1,0,169380,473,2188,214015,275,1715,390291
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G((G("((i7.u36.TestTurn_2_1>=1)&&(i9.u35.Turn_1_2>=1))"))U(F("(i4.u5.EndTurn_1_0>=1)"))))))
Formula 9 simplified : !XG(G"((i7.u36.TestTurn_2_1>=1)&&(i9.u35.Turn_1_2>=1))" U F"(i4.u5.EndTurn_1_0>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,2.38131,98692,1,0,171052,473,2218,215627,276,1715,394368
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X((X("((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_2>=1))"))U(X("(i0.u33.IsEndLoop_0_1_2>=1)"))))))
Formula 10 simplified : !XX(X"((i0.u22.TestTurn_0_1>=1)&&(i9.u35.Turn_1_2>=1))" U X"(i0.u33.IsEndLoop_0_1_2>=1)")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,2.39749,99208,1,0,171908,473,2233,216732,276,1730,397737
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("((i7.u24.TestAlone_2_1_0>=1)&&(i7.u15.WantSection_0_T>=1))"))
Formula 11 simplified : !"((i7.u24.TestAlone_2_1_0>=1)&&(i7.u15.WantSection_0_T>=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,2.39805,99472,1,0,171908,473,2236,216732,276,1730,397744
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X("(i1.u3.TestIdentity_1_1_1>=1)"))))
Formula 12 simplified : !GX"(i1.u3.TestIdentity_1_1_1>=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,2.39886,99472,1,0,171908,473,2248,216732,276,1730,397758
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((F(G("(i1.u12.IsEndLoop_1_1_0>=1)")))U(F("((i9.u35.Turn_1_0>=1)&&(i9.u35.AskForSection_1_1>=1))"))))
Formula 13 simplified : !(FG"(i1.u12.IsEndLoop_1_1_0>=1)" U F"((i9.u35.Turn_1_0>=1)&&(i9.u35.AskForSection_1_1>=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,2.41344,99472,1,0,172891,473,2272,218025,278,1736,400212
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((("((i8.u9.WantSection_0_F>=1)&&(i2.u16.TestAlone_2_0_0>=1))")U(G("(i5.u11.IsEndLoop_0_0_0>=1)")))U(G(("((i2.u21.TestTurn_2_0>=1)&&(i4.u37.Turn_0_1>=1))")U("((i5.u18.Turn_0_0>=1)&&(i2.u21.TestTurn_2_0>=1))")))))
Formula 14 simplified : !(("((i8.u9.WantSection_0_F>=1)&&(i2.u16.TestAlone_2_0_0>=1))" U G"(i5.u11.IsEndLoop_0_0_0>=1)") U G("((i2.u21.TestTurn_2_0>=1)&&(i4.u37.Turn_0_1>=1))" U "((i5.u18.Turn_0_0>=1)&&(i2.u21.TestTurn_2_0>=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,2.42408,100744,1,0,172891,473,2386,218025,278,1736,400330
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X(F(F("(i8.u31.TestIdentity_1_0_2>=1)"))))U(F(G("(i7.u6.IsEndLoop_2_1_1>=1)")))))
Formula 15 simplified : !(XF"(i8.u31.TestIdentity_1_0_2>=1)" U FG"(i7.u6.IsEndLoop_2_1_1>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
20 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.62219,106552,1,0,182303,473,2409,228996,278,1736,420248
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1527504671141

--------------------
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
May 28, 2018 10:51:06 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/, -louvain, -smt]
May 28, 2018 10:51:06 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 10:51:06 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 54 ms
May 28, 2018 10:51:06 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 102 places.
May 28, 2018 10:51:07 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 126 transitions.
May 28, 2018 10:51:07 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
May 28, 2018 10:51:07 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 10:51:07 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 41 ms
May 28, 2018 10:51:07 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 21 ms
Begin: Mon May 28 10:51:07 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Mon May 28 10:51:07 2018
network size: 102 nodes, 384 links, 252 weight
quality increased from -0.0115268 to 0.45231
end computation: Mon May 28 10:51:07 2018
level 1:
start computation: Mon May 28 10:51:07 2018
network size: 38 nodes, 224 links, 252 weight
quality increased from 0.45231 to 0.6046
end computation: Mon May 28 10:51:07 2018
level 2:
start computation: Mon May 28 10:51:07 2018
network size: 14 nodes, 102 links, 252 weight
quality increased from 0.6046 to 0.619181
end computation: Mon May 28 10:51:07 2018
level 3:
start computation: Mon May 28 10:51:07 2018
network size: 10 nodes, 68 links, 252 weight
quality increased from 0.619181 to 0.619181
end computation: Mon May 28 10:51:07 2018
End: Mon May 28 10:51:07 2018
Total duration: 0 sec
0.619181
May 28, 2018 10:51:07 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 10:51:07 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 18 ms
May 28, 2018 10:51:07 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 10:51:07 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 66 redundant transitions.
May 28, 2018 10:51:07 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
May 28, 2018 10:51:07 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
May 28, 2018 10:51:07 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 126 transitions.
May 28, 2018 10:51:07 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 18 ms
May 28, 2018 10:51:07 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 102 variables to be positive in 156 ms
May 28, 2018 10:51:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 126 transitions.
May 28, 2018 10:51:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/126 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:51:07 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 10:51:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 126 transitions.
May 28, 2018 10:51:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:51:09 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 126 transitions.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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)
May 28, 2018 10:51:10 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3184ms 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-PT-2"
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/Peterson-PT-2.tgz
mv Peterson-PT-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 itstoolsl"
echo " Input is Peterson-PT-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 r261-csrt-152732586000160"
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 ;