Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033388900546.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TriangularGrid-PT-2011, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033388900546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 5 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 33K Apr 27 14:36 model.pnml

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

=== Now, execution of the tool begins

BK_START 1590534588628

[2020-05-26 23:09:52] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-26 23:09:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 23:09:52] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-05-26 23:09:52] [INFO ] Transformed 52 places.
[2020-05-26 23:09:52] [INFO ] Transformed 42 transitions.
[2020-05-26 23:09:52] [INFO ] Parsed PT model containing 52 places and 42 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 153 steps, including 0 resets, run visited all 39 properties in 6 ms. (steps per millisecond=25 )
[2020-05-26 23:09:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-26 23:09:52] [INFO ] Flatten gal took : 58 ms
FORMULA TriangularGrid-PT-2011-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 23:09:52] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 23:09:52] [INFO ] Applying decomposition
[2020-05-26 23:09:52] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph7063620067886784012.txt, -o, /tmp/graph7063620067886784012.bin, -w, /tmp/graph7063620067886784012.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7063620067886784012.bin, -l, -1, -v, -w, /tmp/graph7063620067886784012.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 23:09:53] [INFO ] Decomposing Gal with order
[2020-05-26 23:09:53] [INFO ] Input system was already deterministic with 42 transitions.
[2020-05-26 23:09:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 23:09:53] [INFO ] Removed a total of 24 redundant transitions.
[2020-05-26 23:09:53] [INFO ] Flatten gal took : 63 ms
[2020-05-26 23:09:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-26 23:09:53] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-26 23:09:53] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 14 LTL properties
Checking formula 0 : !((G(F((G(("((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))")U("((i3.u3.pbl_2_3<1)||(i3.u12.pi3_2_3<1))")))||((G("((i3.u3.pbl_2_3>=1)&&(i3.u12.pi3_2_3>=1))"))&&("((i2.u2.pbl_2_2<1)||(i2.u16.po3_1_1<1))"))))))
Formula 0 simplified : !GF(G("((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))" U "((i3.u3.pbl_2_3<1)||(i3.u12.pi3_2_3<1))") | ("((i2.u2.pbl_2_2<1)||(i2.u16.po3_1_1<1))" & G"((i3.u3.pbl_2_3>=1)&&(i3.u12.pi3_2_3>=1))"))
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 42 rows 52 cols
[2020-05-26 23:09:53] [INFO ] Computed 23 place invariants in 6 ms
inv : pbl_1_1 + pbl_2_1 + pbl_2_2 + pbl_2_3 + pil1_1_1 + pil1_2_1 + pil1_2_3 + pil2_1_1 + pil2_2_1 + pil2_2_3 + pil3_1_1 + pil3_2_1 + pil3_2_3 + pol1_1_1 + pol1_2_1 + pol1_2_3 + pol2_1_1 + pol2_2_1 + pol2_2_3 + pol3_1_1 + pol3_2_1 + pol3_2_3 = 22
inv : po1_2_1 + pol1_2_1 = 1
inv : po2_1_1 + pol2_1_1 = 1
inv : pb1_2_3 + pb2_2_3 + pb3_2_3 + pbl_2_3 = 4
inv : po3_1_1 + pol3_1_1 = 1
inv : pb1_1_1 + pb2_1_1 + pb3_1_1 + pbl_1_1 = 4
inv : pi2_2_1 + pil2_2_1 = 1
inv : pi1_2_1 + pil1_2_1 = 1
inv : po2_2_1 + pol2_2_1 = 1
inv : pb1_2_1 + pb2_2_1 + pb3_2_1 - pbl_1_1 - pbl_2_2 - pbl_2_3 - pil1_1_1 - pil1_2_1 - pil1_2_3 - pil2_1_1 - pil2_2_1 - pil2_2_3 - pil3_1_1 - pil3_2_1 - pil3_2_3 - pol1_1_1 - pol1_2_1 - pol1_2_3 - pol2_1_1 - pol2_2_1 - pol2_2_3 - pol3_1_1 - pol3_2_1 - pol3_2_3 = -18
inv : pi3_1_1 + pil3_1_1 = 1
inv : po1_2_3 + pol1_2_3 = 1
inv : po3_2_1 + pol3_2_1 = 1
inv : pi2_1_1 + pil2_1_1 = 1
inv : pi2_2_3 + pil2_2_3 = 1
inv : pi3_2_3 + pil3_2_3 = 1
inv : pb1_2_2 + pb2_2_2 + pb3_2_2 + pbl_2_2 = 4
inv : pi1_1_1 + pil1_1_1 = 1
inv : po2_2_3 + pol2_2_3 = 1
inv : pi3_2_1 + pil3_2_1 = 1
inv : po1_1_1 + pol1_1_1 = 1
inv : po3_2_3 + pol3_2_3 = 1
inv : pi1_2_3 + pil1_2_3 = 1
Total of 23 invariants.
[2020-05-26 23:09:53] [INFO ] Computed 23 place invariants in 8 ms
Reverse transition relation is NOT exact ! Due to transitions to1_2_3, to2_2_1, to3_1_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/39/3/42
Computing Next relation with stutter on 99 deadlock states
[2020-05-26 23:09:54] [INFO ] Proved 52 variables to be positive in 465 ms
[2020-05-26 23:09:54] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2020-05-26 23:09:54] [INFO ] Computation of disable matrix completed :0/42 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 23:09:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 23:09:54] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2020-05-26 23:09:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
119 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.2427,55672,1,0,45757,1292,640,318247,119,9075,38376
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(((F(G((G("((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))"))&&(F("((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))")))))||(G("((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))")))U("((i1.u8.pil1_2_1>=1)&&(i1.u18.po1_2_1>=1))"))))
Formula 1 simplified : !G((G"((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))" | FG(G"((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))" & F"((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))")) U "((i1.u8.pil1_2_1>=1)&&(i1.u18.po1_2_1>=1))")
Computing Next relation with stutter on 99 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,1.32352,57980,1,0,50114,1302,669,330176,119,9096,41615
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X((!(G("((i3.u3.pb2_2_3<1)||(i3.u15.pol2_2_3<1))")))&&(!(G(("((i3.u3.pbl_2_3>=1)&&(i3.u12.pi3_2_3>=1))")U((!(F("((i2.u2.pbl_2_2>=1)&&(i2.u20.po2_2_1>=1))")))U("((i3.u3.pb2_2_3>=1)&&(i3.u15.pol2_2_3>=1))")))))))))
Formula 2 simplified : !FX(!G"((i3.u3.pb2_2_3<1)||(i3.u15.pol2_2_3<1))" & !G("((i3.u3.pbl_2_3>=1)&&(i3.u12.pi3_2_3>=1))" U (!F"((i2.u2.pbl_2_2>=1)&&(i2.u20.po2_2_1>=1))" U "((i3.u3.pb2_2_3>=1)&&(i3.u15.pol2_2_3>=1))")))
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
73 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.04492,81708,1,0,70891,1990,723,559661,120,26112,66577
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((((("((i3.u3.pbl_2_3>=1)&&(i3.u12.pi3_2_3>=1))")U("((i3.u3.pb1_2_3>=1)&&(i2.u14.pol1_2_3>=1))"))||(F("((i2.u2.pb1_2_2>=1)&&(i3.u9.pil1_2_3>=1))")))U("((i2.u2.pb1_2_2>=1)&&(i3.u9.pil1_2_3>=1))"))||((X("((i3.u3.pbl_2_3>=1)&&(i3.u12.pi3_2_3>=1))"))&&(G("((i2.u2.pbl_2_2>=1)&&(i2.u14.po1_2_3>=1))"))))))
Formula 3 simplified : !X(((("((i3.u3.pbl_2_3>=1)&&(i3.u12.pi3_2_3>=1))" U "((i3.u3.pb1_2_3>=1)&&(i2.u14.pol1_2_3>=1))") | F"((i2.u2.pb1_2_2>=1)&&(i3.u9.pil1_2_3>=1))") U "((i2.u2.pb1_2_2>=1)&&(i3.u9.pil1_2_3>=1))") | (X"((i3.u3.pbl_2_3>=1)&&(i3.u12.pi3_2_3>=1))" & G"((i2.u2.pbl_2_2>=1)&&(i2.u14.po1_2_3>=1))"))
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
356 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.61409,158504,1,0,126198,4203,759,1.36548e+06,120,41683,100038
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(X((((X(!(X("(((i1.u1.pb3_2_1>=1)&&(i1.u21.pol3_2_1>=1))&&((i0.u0.pbl_1_1<1)||(i0.u7.pi3_1_1<1)))"))))U(F("((i0.u0.pbl_1_1>=1)&&(i0.u4.pi1_1_1>=1))")))&&("(i1.u1.pb3_2_1>=1)"))&&("(i1.u21.pol3_2_1>=1)")))))
Formula 4 simplified : X("(i1.u1.pb3_2_1>=1)" & "(i1.u21.pol3_2_1>=1)" & (X!X"(((i1.u1.pb3_2_1>=1)&&(i1.u21.pol3_2_1>=1))&&((i0.u0.pbl_1_1<1)||(i0.u7.pi3_1_1<1)))" U F"((i0.u0.pbl_1_1>=1)&&(i0.u4.pi1_1_1>=1))"))
Computing Next relation with stutter on 99 deadlock states
[2020-05-26 23:09:59] [INFO ] Computing symmetric co enabling matrix : 42 transitions.
[2020-05-26 23:10:00] [INFO ] Computation of co-enabling matrix(0/42) took 274 ms. Total solver calls (SAT/UNSAT): 41(38/3)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
126 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.8808,185432,1,0,155663,4496,796,1.60518e+06,121,50880,125747
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((X(("((i3.u3.pbl_2_3>=1)&&(i3.u9.pi1_2_3>=1))")U("((i2.u2.pbl_2_2>=1)&&(i2.u16.po3_1_1>=1))")))||(!(X(X(((X("((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))"))||("(i2.u2.pbl_2_2<1)"))||("(i2.u16.po3_1_1<1)")))))))))
Formula 5 simplified : !FX(X("((i3.u3.pbl_2_3>=1)&&(i3.u9.pi1_2_3>=1))" U "((i2.u2.pbl_2_2>=1)&&(i2.u16.po3_1_1>=1))") | !XX("(i2.u2.pbl_2_2<1)" | "(i2.u16.po3_1_1<1)" | X"((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))"))
Computing Next relation with stutter on 99 deadlock states
[2020-05-26 23:10:03] [INFO ] Computation of co-enabling matrix(7/42) took 3681 ms. Total solver calls (SAT/UNSAT): 300(282/18)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
310 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.988,241272,1,0,185873,4637,835,2.16466e+06,121,54747,157058
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F((!(("((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))")U(X("((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))"))))||((X("((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))"))U(X(X("((i1.u1.pbl_2_1>=1)&&(i1.u8.pi1_2_1>=1))"))))))))
Formula 6 simplified : !XF(!("((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))" U X"((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))") | (X"((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))" U XX"((i1.u1.pbl_2_1>=1)&&(i1.u8.pi1_2_1>=1))"))
Computing Next relation with stutter on 99 deadlock states
[2020-05-26 23:10:06] [INFO ] Computation of co-enabling matrix(16/42) took 6910 ms. Total solver calls (SAT/UNSAT): 561(537/24)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
395 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,13.9398,320472,1,0,256555,5129,869,2.86832e+06,121,65004,203415
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G((F((G("((i3.u3.pb1_2_3>=1)&&(i2.u14.pol1_2_3>=1))"))U("((i0.u4.pil1_1_1>=1)&&(i0.u13.po1_1_1>=1))")))||("((i3.u3.pb1_2_3>=1)&&(i2.u14.pol1_2_3>=1))")))))
Formula 7 simplified : !XG("((i3.u3.pb1_2_3>=1)&&(i2.u14.pol1_2_3>=1))" | F(G"((i3.u3.pb1_2_3>=1)&&(i2.u14.pol1_2_3>=1))" U "((i0.u4.pil1_1_1>=1)&&(i0.u13.po1_1_1>=1))"))
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
11 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,14.0531,323640,1,0,260991,5144,897,2.89138e+06,121,65533,207145
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(X(F(!(G((G("((i0.u0.pb2_1_1>=1)&&(i0.u19.pol2_1_1>=1))"))||(F(X("((i1.u1.pbl_2_1>=1)&&(i1.u10.pi2_2_1>=1))"))))))))))
Formula 8 simplified : !XXF!G(G"((i0.u0.pb2_1_1>=1)&&(i0.u19.pol2_1_1>=1))" | FX"((i1.u1.pbl_2_1>=1)&&(i1.u10.pi2_2_1>=1))")
Computing Next relation with stutter on 99 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,14.5388,335520,1,0,278228,5198,917,2.96603e+06,121,67252,219445
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(!(X("((i1.u8.pil1_2_1>=1)&&(i1.u18.po1_2_1>=1))")))))
Formula 9 simplified : !G!X"((i1.u8.pil1_2_1>=1)&&(i1.u18.po1_2_1>=1))"
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,15.0352,348192,1,0,294707,5282,928,3.06069e+06,121,70565,231701
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(G(X(!(X(!(X(G(((G("((i0.u0.pbl_1_1>=1)&&(i0.u5.pi2_1_1>=1))"))&&(F("((i0.u0.pbl_1_1>=1)&&(i0.u5.pi2_1_1>=1))")))U("((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))")))))))))))
Formula 10 simplified : !XGX!X!XG((G"((i0.u0.pbl_1_1>=1)&&(i0.u5.pi2_1_1>=1))" & F"((i0.u0.pbl_1_1>=1)&&(i0.u5.pi2_1_1>=1))") U "((i0.u5.pil2_1_1>=1)&&(i0.u19.po2_1_1>=1))")
Computing Next relation with stutter on 99 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 items max in DFS search stack
58 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,15.6195,362712,1,0,320543,5356,967,3.13315e+06,121,72254,252216
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X((!(F(((("((i3.u12.pil3_2_3>=1)&&(i3.u17.po3_2_3>=1))")U(X("((i2.u2.pb3_2_2>=1)&&(i0.u7.pil3_1_1>=1))")))||("(i2.u2.pb1_2_2<1)"))||("(i3.u9.pil1_2_3<1)"))))U("((i1.u1.pbl_2_1>=1)&&(i1.u8.pi1_2_1>=1))")))))
Formula 11 simplified : !XX(!F("(i2.u2.pb1_2_2<1)" | "(i3.u9.pil1_2_3<1)" | ("((i3.u12.pil3_2_3>=1)&&(i3.u17.po3_2_3>=1))" U X"((i2.u2.pb3_2_2>=1)&&(i0.u7.pil3_1_1>=1))")) U "((i1.u1.pbl_2_1>=1)&&(i1.u8.pi1_2_1>=1))")
Computing Next relation with stutter on 99 deadlock states
[2020-05-26 23:10:09] [INFO ] Computation of co-enabling matrix(29/42) took 9957 ms. Total solver calls (SAT/UNSAT): 795(765/30)
[2020-05-26 23:10:10] [INFO ] Computation of Finished co-enabling matrix. took 11080 ms. Total solver calls (SAT/UNSAT): 861(831/30)
[2020-05-26 23:10:10] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2020-05-26 23:10:11] [INFO ] Computation of Completed DNA matrix. took 606 ms. Total solver calls (SAT/UNSAT): 84(0/84)
[2020-05-26 23:10:11] [INFO ] Built C files in 18269ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 1191 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 86 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(X((!( <>(( ( ((LTLAP25==true))U(X((LTLAP26==true)))) || ( (LTLAP27==true)) ) || ( (LTLAP28==true)) )) )U((LTLAP20==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(X((!( <>(( ( ((LTLAP25==true))U(X((LTLAP26==true)))) || ( (LTLAP27==true)) ) || ( (LTLAP28==true)) )) )U((LTLAP20==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(X((!( <>(( ( ((LTLAP25==true))U(X((LTLAP26==true)))) || ( (LTLAP27==true)) ) || ( (LTLAP28==true)) )) )U((LTLAP20==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
874 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,24.3649,501452,1,0,468095,5602,1003,4.36722e+06,121,79046,302493
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(!(("((i3.u3.pbl_2_3<1)||(i3.u6.pi2_2_3<1))")U(F((F("((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))"))&&("((i1.u1.pbl_2_1<1)||(i1.u8.pi1_2_1<1))")))))))
Formula 12 simplified : !G!("((i3.u3.pbl_2_3<1)||(i3.u6.pi2_2_3<1))" U F("((i1.u1.pbl_2_1<1)||(i1.u8.pi1_2_1<1))" & F"((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))"))
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 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,24.5377,508316,1,0,475353,5631,1031,4.43337e+06,121,79671,309929
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!((((G((G("((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))"))||(F("((((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))&&(i0.u0.pbl_1_1>=1))&&(i0.u4.pi1_1_1>=1))"))))&&("(i0.u0.pb2_1_1>=1)"))&&("(i0.u19.pol2_1_1>=1)"))U("((((i2.u2.pbl_2_2>=1)&&(i2.u16.po3_1_1>=1))&&(i0.u0.pbl_1_1>=1))&&(i0.u5.pi2_1_1>=1))"))))
Formula 13 simplified : ("(i0.u0.pb2_1_1>=1)" & "(i0.u19.pol2_1_1>=1)" & G(G"((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))" | F"((((i3.u3.pbl_2_3>=1)&&(i3.u6.pi2_2_3>=1))&&(i0.u0.pbl_1_1>=1))&&(i0.u4.pi1_1_1>=1))")) U "((((i2.u2.pbl_2_2>=1)&&(i2.u16.po3_1_1>=1))&&(i0.u0.pbl_1_1>=1))&&(i0.u5.pi2_1_1>=1))"
Computing Next relation with stutter on 99 deadlock states
12 unique states visited
0 strongly connected components in search stack
31 transitions explored
11 items max in DFS search stack
2753 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,52.0734,889156,1,0,801819,6221,1140,7.8477e+06,125,99892,467923
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA TriangularGrid-PT-2011-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590534653805

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-2011"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TriangularGrid-PT-2011, 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 r193-csrt-159033388900546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-2011.tgz
mv TriangularGrid-PT-2011 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;