fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r213-smll-152732264800728
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for TriangularGrid-PT-3011

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15752.240 39377.00 79911.00 414.70 TFFTTFFFFFTFFFFF normal

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 244K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K 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.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 70K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is TriangularGrid-PT-3011, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264800728
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527955642718

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/graph3025523516888709990.txt, -o, /tmp/graph3025523516888709990.bin, -w, /tmp/graph3025523516888709990.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/graph3025523516888709990.bin, -l, -1, -v, -w, /tmp/graph3025523516888709990.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 : !(("((i7.u33.pol2_3_5>=1)&&(i7.u8.pb2_3_5>=1))"))
Formula 0 simplified : !"((i7.u33.pol2_3_5>=1)&&(i7.u8.pb2_3_5>=1))"
built 18 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 90 rows 108 cols
invariant :i6:u22:pi2_3_3 + i6:u22:pil2_3_3 = 1
invariant :i7:u8:pb1_3_5 + i7:u8:pb2_3_5 + i7:u8:pb3_3_5 + i7:u8:pbl_3_5 = 4
invariant :i2:u12:pi2_1_1 + i2:u12:pil2_1_1 = 1
invariant :i5:u40:po2_3_1 + i5:u40:pol2_3_1 = 1
invariant :i7:u16:pi3_3_5 + i7:u16:pil3_3_5 = 1
invariant :i6:u43:po3_3_3 + i6:u43:pol3_3_3 = 1
invariant :i2:u9:pi1_1_1 + i2:u9:pil1_1_1 = 1
invariant :i3:u28:po1_2_3 + i3:u28:pol1_2_3 = 1
invariant :i5:u29:po1_3_3 + i5:u29:pol1_3_3 = 1
invariant :i0:u0:pb1_2_1 + i0:u0:pb2_2_1 + i0:u0:pb3_2_1 + i0:u0:pbl_2_1 = 4
invariant :i4:u42:po3_3_1 + i4:u42:pol3_3_1 = 1
invariant :i6:u11:pi1_3_3 + i6:u11:pil1_3_3 = 1
invariant :i1:u32:po2_3_3 + i1:u32:pol2_3_3 = 1
invariant :i2:u38:po2_1_1 + i2:u38:pol2_1_1 = 1
invariant :i6:u26:pi3_3_3 + i6:u26:pil3_3_3 = 1
invariant :i4:u18:pi1_3_1 + i4:u18:pil1_3_1 = 1
invariant :i8:u15:pi3_2_3 + i8:u15:pil3_2_3 = 1
invariant :i8:u31:po2_2_3 + i8:u31:pol2_2_3 = 1
invariant :i5:u34:po3_2_1 + i5:u34:pol3_2_1 = 1
invariant :i4:u21:pi2_3_1 + i4:u21:pil2_3_1 = 1
invariant :i4:u5:pb1_3_1 + i4:u5:pb2_3_1 + i4:u5:pb3_3_1 + i4:u5:pbl_3_1 = 4
invariant :-1'i0:u0:pbl_2_1 + -1'i0:u17:pil1_2_1 + -1'i0:u20:pil2_2_1 + -1'i0:u24:pil3_2_1 + -1'i0:u36:pol1_2_1 + -1'i1:u1:pbl_3_4 + -1'i1:u30:pol1_3_5 + -1'i1:u32:pol2_3_3 + -1'i1:u35:pol3_2_3 + -1'i2:u2:pbl_1_1 + -1'i2:u9:pil1_1_1 + -1'i2:u12:pil2_1_1 + -1'i2:u14:pil3_1_1 + -1'i2:u27:pol1_1_1 + -1'i2:u38:pol2_1_1 + -1'i3:u3:pbl_2_2 + -1'i3:u28:pol1_2_3 + -1'i3:u39:pol2_2_1 + -1'i3:u41:pol3_1_1 + -1'i4:u5:pbl_3_1 + -1'i4:u18:pil1_3_1 + -1'i4:u21:pil2_3_1 + -1'i4:u25:pil3_3_1 + -1'i4:u37:pol1_3_1 + -1'i4:u42:pol3_3_1 + i5:u6:pb1_3_2 + i5:u6:pb2_3_2 + i5:u6:pb3_3_2 + -1'i5:u29:pol1_3_3 + -1'i5:u34:pol3_2_1 + -1'i5:u40:pol2_3_1 + -1'i6:u7:pbl_3_3 + -1'i6:u11:pil1_3_3 + -1'i6:u22:pil2_3_3 + -1'i6:u26:pil3_3_3 + -1'i6:u43:pol3_3_3 + -1'i7:u8:pbl_3_5 + -1'i7:u16:pil3_3_5 + -1'i7:u19:pil1_3_5 + -1'i7:u23:pil2_3_5 + -1'i7:u33:pol2_3_5 + -1'i7:u44:pol3_3_5 + -1'i8:u4:pbl_2_3 + -1'i8:u10:pil1_2_3 + -1'i8:u13:pil2_2_3 + -1'i8:u15:pil3_2_3 + -1'i8:u31:pol2_2_3 = -41
invariant :i4:u25:pi3_3_1 + i4:u25:pil3_3_1 = 1
invariant :i7:u44:po3_3_5 + i7:u44:pol3_3_5 = 1
invariant :i4:u37:po1_3_1 + i4:u37:pol1_3_1 = 1
invariant :i1:u35:po3_2_3 + i1:u35:pol3_2_3 = 1
invariant :i0:u36:po1_2_1 + i0:u36:pol1_2_1 = 1
invariant :i0:u20:pi2_2_1 + i0:u20:pil2_2_1 = 1
invariant :i2:u2:pb1_1_1 + i2:u2:pb2_1_1 + i2:u2:pb3_1_1 + i2:u2:pbl_1_1 = 4
invariant :i7:u33:po2_3_5 + i7:u33:pol2_3_5 = 1
invariant :i3:u39:po2_2_1 + i3:u39:pol2_2_1 = 1
invariant :i3:u41:po3_1_1 + i3:u41:pol3_1_1 = 1
invariant :i6:u7:pb1_3_3 + i6:u7:pb2_3_3 + i6:u7:pb3_3_3 + i6:u7:pbl_3_3 = 4
invariant :i7:u23:pi2_3_5 + i7:u23:pil2_3_5 = 1
invariant :i0:u0:pbl_2_1 + i0:u17:pil1_2_1 + i0:u20:pil2_2_1 + i0:u24:pil3_2_1 + i0:u36:pol1_2_1 + i1:u1:pbl_3_4 + i1:u30:pol1_3_5 + i1:u32:pol2_3_3 + i1:u35:pol3_2_3 + i2:u2:pbl_1_1 + i2:u9:pil1_1_1 + i2:u12:pil2_1_1 + i2:u14:pil3_1_1 + i2:u27:pol1_1_1 + i2:u38:pol2_1_1 + i3:u3:pbl_2_2 + i3:u28:pol1_2_3 + i3:u39:pol2_2_1 + i3:u41:pol3_1_1 + i4:u5:pbl_3_1 + i4:u18:pil1_3_1 + i4:u21:pil2_3_1 + i4:u25:pil3_3_1 + i4:u37:pol1_3_1 + i4:u42:pol3_3_1 + i5:u6:pbl_3_2 + i5:u29:pol1_3_3 + i5:u34:pol3_2_1 + i5:u40:pol2_3_1 + i6:u7:pbl_3_3 + i6:u11:pil1_3_3 + i6:u22:pil2_3_3 + i6:u26:pil3_3_3 + i6:u43:pol3_3_3 + i7:u8:pbl_3_5 + i7:u16:pil3_3_5 + i7:u19:pil1_3_5 + i7:u23:pil2_3_5 + i7:u33:pol2_3_5 + i7:u44:pol3_3_5 + i8:u4:pbl_2_3 + i8:u10:pil1_2_3 + i8:u13:pil2_2_3 + i8:u15:pil3_2_3 + i8:u31:pol2_2_3 = 45
invariant :i8:u13:pi2_2_3 + i8:u13:pil2_2_3 = 1
invariant :i2:u27:po1_1_1 + i2:u27:pol1_1_1 = 1
invariant :i8:u4:pb1_2_3 + i8:u4:pb2_2_3 + i8:u4:pb3_2_3 + i8:u4:pbl_2_3 = 4
invariant :i0:u24:pi3_2_1 + i0:u24:pil3_2_1 = 1
invariant :i8:u10:pi1_2_3 + i8:u10:pil1_2_3 = 1
invariant :i3:u3:pb1_2_2 + i3:u3:pb2_2_2 + i3:u3:pb3_2_2 + i3:u3:pbl_2_2 = 4
invariant :i7:u19:pi1_3_5 + i7:u19:pil1_3_5 = 1
invariant :i0:u17:pi1_2_1 + i0:u17:pil1_2_1 = 1
invariant :i1:u30:po1_3_5 + i1:u30:pol1_3_5 = 1
invariant :i2:u14:pi3_1_1 + i2:u14:pil3_1_1 = 1
invariant :i1:u1:pb1_3_4 + i1:u1:pb2_3_4 + i1:u1:pb3_3_4 + i1:u1:pbl_3_4 = 4
Reverse transition relation is NOT exact ! Due to transitions to1_1_1, to1_2_2, to1_2_3, to1_3_1, to1_3_2, to1_3_3, to1_3_4, to1_3_5, to2_1_1, to2_2_1, to2_2_2, to2_3_1, to2_3_2, to2_3_3, to2_3_4, to2_3_5, to3_1_1, to3_2_1, to3_2_2, to3_2_3, to3_3_1, to3_3_2, to3_3_4, to3_3_5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Computing Next relation with stutter on 2.42921e+06 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
413 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.17818,88016,1,0,105828,2119,695,320803,114,13214,40088
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TriangularGrid-PT-3011-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((X(X("((i7.u23.pil2_3_5>=1)&&(i7.u33.po2_3_5>=1))")))U("((i2.u9.pi1_1_1>=1)&&(i2.u2.pbl_1_1>=1))"))))
Formula 1 simplified : !G(XX"((i7.u23.pil2_3_5>=1)&&(i7.u33.po2_3_5>=1))" U "((i2.u9.pi1_1_1>=1)&&(i2.u2.pbl_1_1>=1))")
Computing Next relation with stutter on 2.42921e+06 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
143 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.60565,123696,1,0,167148,3026,926,478351,117,22436,112999
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA TriangularGrid-PT-3011-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(F(F(X("((i2.u14.pi3_1_1>=1)&&(i2.u2.pbl_1_1>=1))")))))))
Formula 2 simplified : !FGFX"((i2.u14.pi3_1_1>=1)&&(i2.u2.pbl_1_1>=1))"
Computing Next relation with stutter on 2.42921e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
42 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.03254,132604,1,0,182001,3026,964,506950,117,22456,120397
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA TriangularGrid-PT-3011-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(G(G("((i8.u15.pi3_2_3>=1)&&(i8.u4.pbl_2_3>=1))"))))U(("((i5.u6.pbl_3_2>=1)&&(i5.u29.po1_3_3>=1))")U(F("((i2.u27.pol1_1_1>=1)&&(i2.u2.pb1_1_1>=1))")))))
Formula 3 simplified : !(FG"((i8.u15.pi3_2_3>=1)&&(i8.u4.pbl_2_3>=1))" U ("((i5.u6.pbl_3_2>=1)&&(i5.u29.po1_3_3>=1))" U F"((i2.u27.pol1_1_1>=1)&&(i2.u2.pb1_1_1>=1))"))
Computing Next relation with stutter on 2.42921e+06 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.03488,133560,1,0,182001,3026,985,506950,117,22456,120421
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA TriangularGrid-PT-3011-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((i2.u38.pol2_1_1>=1)&&(i2.u2.pb2_1_1>=1))"))
Formula 4 simplified : !"((i2.u38.pol2_1_1>=1)&&(i2.u2.pb2_1_1>=1))"
Computing Next relation with stutter on 2.42921e+06 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.03525,133560,1,0,182001,3026,996,506950,117,22456,120439
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA TriangularGrid-PT-3011-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((X("((i7.u23.pil2_3_5>=1)&&(i7.u33.po2_3_5>=1))"))U(X("((i7.u33.pol2_3_5>=1)&&(i7.u8.pb2_3_5>=1))")))U("((i7.u23.pi2_3_5>=1)&&(i7.u8.pbl_3_5>=1))")))
Formula 5 simplified : !((X"((i7.u23.pil2_3_5>=1)&&(i7.u33.po2_3_5>=1))" U X"((i7.u33.pol2_3_5>=1)&&(i7.u8.pb2_3_5>=1))") U "((i7.u23.pi2_3_5>=1)&&(i7.u8.pbl_3_5>=1))")
Computing Next relation with stutter on 2.42921e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
165 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,7.67646,181880,1,0,240838,4065,1026,879549,117,48870,187541
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA TriangularGrid-PT-3011-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(G("((i1.u30.pol1_3_5>=1)&&(i7.u8.pb1_3_5>=1))"))))
Formula 6 simplified : !G"((i1.u30.pol1_3_5>=1)&&(i7.u8.pb1_3_5>=1))"
Computing Next relation with stutter on 2.42921e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
183 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,9.5115,228080,1,0,281600,4745,1045,1.32047e+06,117,54277,215787
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA TriangularGrid-PT-3011-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((("((i3.u28.pol1_2_3>=1)&&(i8.u4.pb1_2_3>=1))")U("((i3.u39.po2_2_1>=1)&&(i3.u3.pbl_2_2>=1))")))
Formula 7 simplified : !("((i3.u28.pol1_2_3>=1)&&(i8.u4.pb1_2_3>=1))" U "((i3.u39.po2_2_1>=1)&&(i3.u3.pbl_2_2>=1))")
Computing Next relation with stutter on 2.42921e+06 deadlock states
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]
Compilation finished in 2902 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, ((LTLAP10==true))U((LTLAP11==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 44 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, []((X(<>((LTLAP8==true))))U(X(<>((LTLAP12==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 92 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, (<>([]([]((LTLAP0==true)))))U(X([](X((LTLAP13==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 23 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, (LTLAP14==true), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 19 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, [](<>((LTLAP15==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 31 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, X(<>(((LTLAP16==true))U([]((LTLAP17==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 27 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, []([]([](X((LTLAP18==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 88 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, <>([](X((LTLAP19==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 34 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, X(X(<>([](X((LTLAP11==true)))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 25 ms.
FORMULA TriangularGrid-PT-3011-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1527955682095

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

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

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 16:07:26 2018
network size: 108 nodes, 432 links, 180 weight
quality increased from -0.0118056 to 0.468889
end computation: Sat Jun 2 16:07:26 2018
level 1:
start computation: Sat Jun 2 16:07:26 2018
network size: 45 nodes, 171 links, 180 weight
quality increased from 0.468889 to 0.788148
end computation: Sat Jun 2 16:07:26 2018
level 2:
start computation: Sat Jun 2 16:07:26 2018
network size: 9 nodes, 27 links, 180 weight
quality increased from 0.788148 to 0.788148
end computation: Sat Jun 2 16:07:26 2018
End: Sat Jun 2 16:07:26 2018
Total duration: 0 sec
0.788148
Jun 02, 2018 4:07:26 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 4:07:26 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Jun 02, 2018 4:07:26 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 4:07:26 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 54 redundant transitions.
Jun 02, 2018 4:07:26 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
Jun 02, 2018 4:07:26 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Jun 02, 2018 4:07:27 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 90 transitions.
Jun 02, 2018 4:07:27 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 46 place invariants in 40 ms
Jun 02, 2018 4:07:27 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 108 variables to be positive in 379 ms
Jun 02, 2018 4:07:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 90 transitions.
Jun 02, 2018 4:07:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/90 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 4:07:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 4:07:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 90 transitions.
Jun 02, 2018 4:07:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 4:07:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 90 transitions.
Jun 02, 2018 4:07:30 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(3/90) took 2145 ms. Total solver calls (SAT/UNSAT): 350(338/12)
Jun 02, 2018 4:07:34 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(11/90) took 5583 ms. Total solver calls (SAT/UNSAT): 1002(974/28)
Jun 02, 2018 4:07:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(18/90) took 9059 ms. Total solver calls (SAT/UNSAT): 1520(1487/33)
Jun 02, 2018 4:07:41 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(26/90) took 12450 ms. Total solver calls (SAT/UNSAT): 2052(2013/39)
Jun 02, 2018 4:07:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(35/90) took 15689 ms. Total solver calls (SAT/UNSAT): 2574(2529/45)
Jun 02, 2018 4:07:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(45/90) took 18806 ms. Total solver calls (SAT/UNSAT): 3059(3007/52)
Jun 02, 2018 4:07:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(57/90) took 21879 ms. Total solver calls (SAT/UNSAT): 3509(3448/61)
Jun 02, 2018 4:07:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(79/90) took 24895 ms. Total solver calls (SAT/UNSAT): 3960(3897/63)
Jun 02, 2018 4:07:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 25384 ms. Total solver calls (SAT/UNSAT): 4005(3942/63)
Jun 02, 2018 4:07:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 90 transitions.
Jun 02, 2018 4:07:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 3520 ms. Total solver calls (SAT/UNSAT): 189(0/189)
Jun 02, 2018 4:07:57 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 30694ms 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="TriangularGrid-PT-3011"
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/TriangularGrid-PT-3011.tgz
mv TriangularGrid-PT-3011 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 TriangularGrid-PT-3011, 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 r213-smll-152732264800728"
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 ;