Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940145000394.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 JoinFreeModules-PT-0004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145000394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K Apr 7 18:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 7 18:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 6 20:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 6 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 5 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 5 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 23K Mar 24 05:37 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 JoinFreeModules-PT-0004-00
FORMULA_NAME JoinFreeModules-PT-0004-01
FORMULA_NAME JoinFreeModules-PT-0004-02
FORMULA_NAME JoinFreeModules-PT-0004-03
FORMULA_NAME JoinFreeModules-PT-0004-04
FORMULA_NAME JoinFreeModules-PT-0004-05
FORMULA_NAME JoinFreeModules-PT-0004-06
FORMULA_NAME JoinFreeModules-PT-0004-07
FORMULA_NAME JoinFreeModules-PT-0004-08
FORMULA_NAME JoinFreeModules-PT-0004-09
FORMULA_NAME JoinFreeModules-PT-0004-10
FORMULA_NAME JoinFreeModules-PT-0004-11
FORMULA_NAME JoinFreeModules-PT-0004-12
FORMULA_NAME JoinFreeModules-PT-0004-13
FORMULA_NAME JoinFreeModules-PT-0004-14
FORMULA_NAME JoinFreeModules-PT-0004-15

=== Now, execution of the tool begins

BK_START 1589574107297

[2020-05-15 20:21:48] [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-15 20:21:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:21:48] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2020-05-15 20:21:48] [INFO ] Transformed 21 places.
[2020-05-15 20:21:48] [INFO ] Transformed 33 transitions.
[2020-05-15 20:21:48] [INFO ] Parsed PT model containing 21 places and 33 transitions in 59 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 364 resets, run finished after 125 ms. (steps per millisecond=800 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 33 rows 20 cols
[2020-05-15 20:21:48] [INFO ] Computed 4 place invariants in 4 ms
[2020-05-15 20:21:49] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2020-05-15 20:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:21:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-15 20:21:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:21:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2020-05-15 20:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 20:21:49] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-05-15 20:21:49] [INFO ] Deduced a trap composed of 3 places in 31 ms
[2020-05-15 20:21:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 20:21:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-15 20:21:49] [INFO ] Flatten gal took : 25 ms
FORMULA JoinFreeModules-PT-0004-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:21:49] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
[2020-05-15 20:21:49] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-15 20:21:49] [INFO ] Flatten gal took : 4 ms
[2020-05-15 20:21:49] [INFO ] Input system was already deterministic with 33 transitions.
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/graph18033033260962075007.txt, -o, /tmp/graph18033033260962075007.bin, -w, /tmp/graph18033033260962075007.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 33 rows 20 cols
[2020-05-15 20:21:49] [INFO ] Computed 4 place invariants in 1 ms
inv : p6 + p7 + p8 + p9 + p10 = 7
inv : p1 + p2 + p3 + p4 + p5 = 7
inv : p11 + p12 + p13 + p14 + p15 = 7
inv : p16 + p17 + p18 + p19 + p20 = 7
Total of 4 invariants.
[2020-05-15 20:21:49] [INFO ] Computed 4 place invariants in 1 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph18033033260962075007.bin, -l, -1, -v, -w, /tmp/graph18033033260962075007.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 20:21:49] [INFO ] Decomposing Gal with order
[2020-05-15 20:21:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:21:49] [INFO ] Proved 20 variables to be positive in 47 ms
[2020-05-15 20:21:49] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2020-05-15 20:21:49] [INFO ] Computation of disable matrix completed :0/33 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:21:49] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:21:49] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2020-05-15 20:21:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:21:49] [INFO ] Flatten gal took : 49 ms
[2020-05-15 20:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-15 20:21:49] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-15 20:21:49] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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 : !((F(!(X(F((!(X("(i0.u1.p4>=4)")))&&((!(G("(i2.u5.p13<1)")))||("(i2.u5.p13>=2)"))))))))
Formula 0 simplified : !F!XF(!X"(i0.u1.p4>=4)" & ("(i2.u5.p13>=2)" | !G"(i2.u5.p13<1)"))
built 1 ordering constraints for composite.
built 2 ordering constraints for composite.
built 2 ordering constraints for composite.
built 2 ordering constraints for composite.
built 2 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.t4, i0.t3, i0.u0.t2, i1.t12, i1.t11, i1.u2.t10, i2.t20, i2.t19, i2.u5.t18, i3.t28, i3.t27, i3.u7.t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/12/33
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
5 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.065041,19624,1,0,3129,1153,408,6895,187,5256,3268
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!((F("(i3.u6.p19>=4)"))U(G("(i3.u6.p16<5)")))))
Formula 1 simplified : F"(i3.u6.p19>=4)" U G"(i3.u6.p16<5)"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.078421,20040,1,0,3865,1272,446,8343,188,5974,4451
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(G(!(F(X(X((!(X(X(!(F("(i0.u1.p5>=5)"))))))||("(i2.u4.p14<3)"))))))))))
Formula 2 simplified : !GFG!FXX("(i2.u4.p14<3)" | !XX!F"(i0.u1.p5>=5)")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.084172,20608,1,0,3934,1284,463,8529,189,6057,4547
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(X((G("(i1.u2.p8>=2)"))U((!(F(G("(i3.u6.p16>=3)"))))&&("(i3.u6.p16<3)")))))&&(F("(i1.u3.p6<5)"))))
Formula 3 simplified : !(GX(G"(i1.u2.p8>=2)" U ("(i3.u6.p16<3)" & !FG"(i3.u6.p16>=3)")) & F"(i1.u3.p6<5)")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.088568,20856,1,0,4004,1284,499,8617,192,6082,4720
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(X("(i1.u3.p10<5)")))U((("(i2.u5.p13>=1)")U("(i2.u5.p13<1)"))||("((i2.u5.p13>=1)&&(i0.u1.p1>=5))"))))
Formula 4 simplified : !(GX"(i1.u3.p10<5)" U ("((i2.u5.p13>=1)&&(i0.u1.p1>=5))" | ("(i2.u5.p13>=1)" U "(i2.u5.p13<1)")))
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 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.117279,21644,1,0,5973,1618,557,12482,197,8527,6542
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((X(!(F("(i1.u2.p7>=2)"))))&&(X("(i1.u3.p6<3)")))))
Formula 5 simplified : !G(X!F"(i1.u2.p7>=2)" & X"(i1.u3.p6<3)")
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.119782,21908,1,0,6057,1621,593,12621,198,8535,6770
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(G(F(("(i3.u7.p18>=2)")&&(((X(X(G("(i0.u0.p2>=2)"))))U("(i2.u4.p15>=5)"))||("(i1.u3.p6>=5)"))))))))
Formula 6 simplified : !FXGF("(i3.u7.p18>=2)" & ("(i1.u3.p6>=5)" | (XXG"(i0.u0.p2>=2)" U "(i2.u4.p15>=5)")))
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.136143,22172,1,0,6666,1794,635,14098,198,9536,7435
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(X(((!(F("(i0.u0.p3<2)")))&&("(i0.u0.p3>=2)"))U((X("(i2.u4.p15>=5)"))&&(F("(i1.u3.p6>=3)"))))))))
Formula 7 simplified : !XXX(("(i0.u0.p3>=2)" & !F"(i0.u0.p3<2)") U (X"(i2.u4.p15>=5)" & F"(i1.u3.p6>=3)"))
Computing Next relation with stutter on 16 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.14096,22436,1,0,6951,1797,649,14335,201,9552,7938
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(G((!(X("(i3.u7.p17>=2)")))&&("(((i1.u3.p9<3)||(i3.u7.p17<2))||(i2.u4.p11<5))")))))
Formula 8 simplified : G("(((i1.u3.p9<3)||(i3.u7.p17<2))||(i2.u4.p11<5))" & !X"(i3.u7.p17>=2)")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.159345,22964,1,0,8335,1940,678,17564,201,10509,9124
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((!(X("(i3.u6.p16>=3)")))U(((F("(i3.u7.p18>=2)"))U("(i3.u7.p18>=2)"))U("(i3.u7.p18>=2)")))))
Formula 9 simplified : !X(!X"(i3.u6.p16>=3)" U ((F"(i3.u7.p18>=2)" U "(i3.u7.p18>=2)") U "(i3.u7.p18>=2)"))
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.160064,22964,1,0,8335,1940,682,17564,201,10509,9134
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0004-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F("(i2.u5.p12>=2)"))||((F("(((i3.u7.p18>=1)||(i1.u2.p8>=2))||(i2.u4.p15>=5))"))&&(!(F("(i3.u7.p18>=2)"))))))
Formula 10 simplified : !(F"(i2.u5.p12>=2)" | (F"(((i3.u7.p18>=1)||(i1.u2.p8>=2))||(i2.u4.p15>=5))" & !F"(i3.u7.p18>=2)"))
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.161846,23228,1,0,8390,1946,721,17645,201,10525,9230
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G(!(F(("(i3.u7.p18>=1)")U(G((X("(i3.u7.p18<1)"))||(F("(i0.u1.p5>=5)"))))))))))
Formula 11 simplified : !FG!F("(i3.u7.p18>=1)" U G(X"(i3.u7.p18<1)" | F"(i0.u1.p5>=5)"))
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.167006,23492,1,0,8709,2026,751,18329,201,10866,9604
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(X(!(G(F("(i0.u1.p1>=5)"))))))U(X(X((F("(i3.u6.p19>=3)"))U("(i3.u7.p18>=2)"))))))
Formula 12 simplified : !(XX!GF"(i0.u1.p1>=5)" U XX(F"(i3.u6.p19>=3)" U "(i3.u7.p18>=2)"))
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.179229,23756,1,0,9644,2133,787,20083,201,11324,10727
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(X((!(((F("(i0.u1.p4>=4)"))&&("(i1.u3.p6>=5)"))U("((i1.u3.p6>=5)&&(i2.u5.p13>=1))")))||("(i1.u3.p6<5)")))))
Formula 13 simplified : !XX("(i1.u3.p6<5)" | !(("(i1.u3.p6>=5)" & F"(i0.u1.p4>=4)") U "((i1.u3.p6>=5)&&(i2.u5.p13>=1))"))
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.180733,24284,1,0,9646,2133,814,20084,203,11324,10774
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0004-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 20:21:49] [INFO ] Built C files in 400ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589574113453

--------------------
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="JoinFreeModules-PT-0004"
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 JoinFreeModules-PT-0004, 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 r096-oct2-158940145000394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 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 ;