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-158940144600074.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 HexagonalGrid-PT-110, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940144600074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 5.9K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 29K 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 HexagonalGrid-PT-110-00
FORMULA_NAME HexagonalGrid-PT-110-01
FORMULA_NAME HexagonalGrid-PT-110-02
FORMULA_NAME HexagonalGrid-PT-110-03
FORMULA_NAME HexagonalGrid-PT-110-04
FORMULA_NAME HexagonalGrid-PT-110-05
FORMULA_NAME HexagonalGrid-PT-110-06
FORMULA_NAME HexagonalGrid-PT-110-07
FORMULA_NAME HexagonalGrid-PT-110-08
FORMULA_NAME HexagonalGrid-PT-110-09
FORMULA_NAME HexagonalGrid-PT-110-10
FORMULA_NAME HexagonalGrid-PT-110-11
FORMULA_NAME HexagonalGrid-PT-110-12
FORMULA_NAME HexagonalGrid-PT-110-13
FORMULA_NAME HexagonalGrid-PT-110-14
FORMULA_NAME HexagonalGrid-PT-110-15

=== Now, execution of the tool begins

BK_START 1589545312359

[2020-05-15 12:21:54] [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 12:21:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 12:21:54] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-05-15 12:21:54] [INFO ] Transformed 31 places.
[2020-05-15 12:21:54] [INFO ] Transformed 42 transitions.
[2020-05-15 12:21:54] [INFO ] Parsed PT model containing 31 places and 42 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 21 steps, including 0 resets, run visited all 31 properties in 2 ms. (steps per millisecond=10 )
[2020-05-15 12:21:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-15 12:21:54] [INFO ] Flatten gal took : 44 ms
FORMULA HexagonalGrid-PT-110-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 12:21:54] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 12:21:54] [INFO ] Applying decomposition
[2020-05-15 12:21:54] [INFO ] Flatten gal took : 5 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/graph5815411677499731086.txt, -o, /tmp/graph5815411677499731086.bin, -w, /tmp/graph5815411677499731086.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/graph5815411677499731086.bin, -l, -1, -v, -w, /tmp/graph5815411677499731086.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 12:21:55] [INFO ] Input system was already deterministic with 42 transitions.
[2020-05-15 12:21:55] [INFO ] Decomposing Gal with order
[2020-05-15 12:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 12:21:55] [INFO ] Removed a total of 48 redundant transitions.
[2020-05-15 12:21:55] [INFO ] Flatten gal took : 77 ms
[2020-05-15 12:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-15 12:21:55] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-15 12:21:55] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 8 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
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 42 rows 31 cols
[2020-05-15 12:21:55] [INFO ] Computed 14 place invariants in 4 ms
inv : po2_1_1 + pol2_1_1 = 1
inv : pbl_1_1 + pil1_1_1 + pil2_1_1 + pil3_1_1 + pil4_1_1 + pil5_1_1 + pil6_1_1 + pol1_1_1 + pol2_1_1 + pol3_1_1 + pol4_1_1 + pol5_1_1 + pol6_1_1 = 12
inv : pi3_1_1 + pil3_1_1 = 1
inv : po1_1_1 + pol1_1_1 = 1
inv : po3_1_1 + pol3_1_1 = 1
inv : pi2_1_1 + pil2_1_1 = 1
inv : po6_1_1 + pol6_1_1 = 1
inv : pb1_1_1 + pb2_1_1 + pb3_1_1 + pb4_1_1 + pb5_1_1 + pb6_1_1 - pil1_1_1 - pil2_1_1 - pil3_1_1 - pil4_1_1 - pil5_1_1 - pil6_1_1 - pol1_1_1 - pol2_1_1 - pol3_1_1 - pol4_1_1 - pol5_1_1 - pol6_1_1 = -6
inv : pi6_1_1 + pil6_1_1 = 1
inv : pi1_1_1 + pil1_1_1 = 1
inv : pi5_1_1 + pil5_1_1 = 1
inv : po5_1_1 + pol5_1_1 = 1
inv : pi4_1_1 + pil4_1_1 = 1
inv : po4_1_1 + pol4_1_1 = 1
Total of 14 invariants.
[2020-05-15 12:21:55] [INFO ] Computed 14 place invariants in 5 ms
Checking formula 0 : !((G(("((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))")U(!((((X("((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))"))&&("(i1.u1.pil2_1_1>=1)"))&&("(i1.u9.po2_1_1>=1)"))U(((X("((u0.pbl_1_1>=1)&&(i5.u5.pi4_1_1>=1))"))&&("(u0.pbl_1_1>=1)"))&&("(i6.u6.pi5_1_1>=1)")))))))
Formula 0 simplified : !G("((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))" U !(("(i1.u1.pil2_1_1>=1)" & "(i1.u9.po2_1_1>=1)" & X"((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))") U ("(i6.u6.pi5_1_1>=1)" & "(u0.pbl_1_1>=1)" & X"((u0.pbl_1_1>=1)&&(i5.u5.pi4_1_1>=1))")))
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
[2020-05-15 12:21:55] [INFO ] Proved 31 variables to be positive in 91 ms
[2020-05-15 12:21:55] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2020-05-15 12:21:55] [INFO ] Computation of disable matrix completed :0/42 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-15 12:21:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 12:21:55] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2020-05-15 12:21:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
6 unique states visited
3 strongly connected components in search stack
8 transitions explored
4 items max in DFS search stack
12 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.148114,21348,1,0,3897,5077,497,5898,234,22276,4654
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(F((G("(((((i1.u1.pil2_1_1>=1)&&(i1.u9.po2_1_1>=1))||((u0.pbl_1_1>=1)&&(i2.u2.pi3_1_1>=1)))&&(u0.pbl_1_1>=1))&&(i2.u2.pi3_1_1>=1))"))&&(X("((i1.u1.pil2_1_1>=1)&&(i1.u9.po2_1_1>=1))")))))))
Formula 1 simplified : !FGF(G"(((((i1.u1.pil2_1_1>=1)&&(i1.u9.po2_1_1>=1))||((u0.pbl_1_1>=1)&&(i2.u2.pi3_1_1>=1)))&&(u0.pbl_1_1>=1))&&(i2.u2.pi3_1_1>=1))" & X"((i1.u1.pil2_1_1>=1)&&(i1.u9.po2_1_1>=1))")
2 unique states visited
2 strongly connected components in search stack
3 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.19048,22260,1,0,5393,5737,546,8115,234,28172,6216
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(X(F(!(("((u0.pb2_1_1<1)||(i1.u9.pol2_1_1<1))")U("((u0.pbl_1_1>=1)&&(i3.u4.pi1_1_1>=1))"))))))))
Formula 2 simplified : !FXXF!("((u0.pb2_1_1<1)||(i1.u9.pol2_1_1<1))" U "((u0.pbl_1_1>=1)&&(i3.u4.pi1_1_1>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
76 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.949243,44168,1,0,23728,26686,590,77694,234,260885,19637
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X((((F(X(F("((u0.pbl_1_1>=1)&&(i4.u3.pi6_1_1>=1))"))))&&("(u0.pbl_1_1>=1)"))&&("(i4.u3.pi6_1_1>=1)"))||(G("((u0.pbl_1_1>=1)&&(i4.u3.pi6_1_1>=1))"))))))
Formula 3 simplified : X(("(i4.u3.pi6_1_1>=1)" & "(u0.pbl_1_1>=1)" & FXF"((u0.pbl_1_1>=1)&&(i4.u3.pi6_1_1>=1))") | G"((u0.pbl_1_1>=1)&&(i4.u3.pi6_1_1>=1))")
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.950524,44696,1,0,23728,26686,610,77694,234,260885,19687
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA HexagonalGrid-PT-110-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(("((u0.pb4_1_1<1)||(i5.u11.pol4_1_1<1))")U(((((F("((u0.pbl_1_1>=1)&&(i5.u5.pi4_1_1>=1))"))||("((u0.pbl_1_1>=1)&&(i5.u5.pi4_1_1>=1))"))&&("(u0.pb4_1_1>=1)"))&&("(i5.u11.pol4_1_1>=1)"))||(X("((u0.pb2_1_1>=1)&&(i1.u9.pol2_1_1>=1))"))))))
Formula 4 simplified : "((u0.pb4_1_1<1)||(i5.u11.pol4_1_1<1))" U (("(i5.u11.pol4_1_1>=1)" & "(u0.pb4_1_1>=1)" & ("((u0.pbl_1_1>=1)&&(i5.u5.pi4_1_1>=1))" | F"((u0.pbl_1_1>=1)&&(i5.u5.pi4_1_1>=1))")) | X"((u0.pb2_1_1>=1)&&(i1.u9.pol2_1_1>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
30 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.25096,57104,1,0,36337,42144,670,122508,237,385886,26511
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G("((u0.pb5_1_1>=1)&&(i6.u12.pol5_1_1>=1))"))))
Formula 5 simplified : G"((u0.pb5_1_1>=1)&&(i6.u12.pol5_1_1>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
21 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.45309,63176,1,0,41366,49796,696,142954,237,445333,28988
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((!(X((X(F("((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))")))||("((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))"))))U("((u0.pbl_1_1>=1)&&(i2.u2.pi3_1_1>=1))"))))
Formula 6 simplified : !F(!X("((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))" | XF"((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))") U "((u0.pbl_1_1>=1)&&(i2.u2.pi3_1_1>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
36 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.82118,78616,1,0,52997,65912,721,199661,237,617076,34602
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(!((F("((i3.u4.pil1_1_1<1)||(i3.u8.po1_1_1<1))"))U(X(G("((u0.pbl_1_1>=1)&&(i4.u3.pi6_1_1>=1))"))))))&&(X("((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))"))))
Formula 7 simplified : !(G!(F"((i3.u4.pil1_1_1<1)||(i3.u8.po1_1_1<1))" U XG"((u0.pbl_1_1>=1)&&(i4.u3.pi6_1_1>=1))") & X"((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))")
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,1.83708,79672,1,0,53894,66528,744,201579,237,621619,35584
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((G((X(G(!(X("((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))")))))||("((u0.pbl_1_1>=1)&&(i2.u2.pi3_1_1>=1))")))U("((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))"))))
Formula 8 simplified : !X(G("((u0.pbl_1_1>=1)&&(i2.u2.pi3_1_1>=1))" | XG!X"((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))") U "((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
32 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.14428,88648,1,0,62004,74089,755,236710,237,712722,40444
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((X(((F(!(X("((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))"))))U(G("((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))")))&&(!(X("((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))")))))||("((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))"))))
Formula 9 simplified : !X("((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))" | X(!X"((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))" & (F!X"((u0.pbl_1_1>=1)&&(i1.u1.pi2_1_1>=1))" U G"((u0.pbl_1_1>=1)&&(i6.u6.pi5_1_1>=1))")))
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
12 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.26366,93400,1,0,67336,80024,767,253458,237,757523,43623
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(G("((i2.u2.pil3_1_1>=1)&&(i2.u10.po3_1_1>=1))")))))
Formula 10 simplified : !XXG"((i2.u2.pil3_1_1>=1)&&(i2.u10.po3_1_1>=1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.29435,94984,1,0,69298,80902,809,257429,249,764875,46093
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(F((!((X(F("((u0.pbl_1_1>=1)&&(i2.u2.pi3_1_1>=1))")))U(F("((((i3.u4.pil1_1_1<1)||(i3.u8.po1_1_1<1))&&(i1.u1.pil2_1_1>=1))&&(i1.u9.po2_1_1>=1))"))))&&("((u0.pbl_1_1<1)||(i3.u4.pi1_1_1<1))")))))
Formula 11 simplified : F("((u0.pbl_1_1<1)||(i3.u4.pi1_1_1<1))" & !(XF"((u0.pbl_1_1>=1)&&(i2.u2.pi3_1_1>=1))" U F"((((i3.u4.pil1_1_1<1)||(i3.u8.po1_1_1<1))&&(i1.u1.pil2_1_1>=1))&&(i1.u9.po2_1_1>=1))"))
3 unique states visited
3 strongly connected components in search stack
4 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,2.30666,95512,1,0,70294,81060,847,258657,249,767147,47247
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("((i6.u6.pil5_1_1>=1)&&(i6.u12.po5_1_1>=1))")))
Formula 12 simplified : !F"((i6.u6.pil5_1_1>=1)&&(i6.u12.po5_1_1>=1))"
2 unique states visited
2 strongly connected components in search stack
2 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,2.30733,95776,1,0,70296,81060,865,258672,249,767151,47271
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(X(X(G(((F(G("((u0.pbl_1_1>=1)&&(i3.u4.pi1_1_1>=1))")))&&("(u0.pbl_1_1>=1)"))&&("(i4.u3.pi6_1_1>=1)")))))))
Formula 13 simplified : !XXXG("(i4.u3.pi6_1_1>=1)" & "(u0.pbl_1_1>=1)" & FG"((u0.pbl_1_1>=1)&&(i3.u4.pi1_1_1>=1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
14 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.45,101056,1,0,76488,86784,898,279990,249,814089,51314
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-15 12:21:58] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 6) 1) (>= (select s0 8) 1)) (= (store (store (store (store s0 4 (+ (select s0 4) 1)) 8 (- (select s0 8) 1)) 14 (+ (select s0 14) 1)) 6 (- (select s0 6) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 6) 1) (>= (select s0 8) 1)) (= (store (store (store (store s0 4 (+ (select s0 4) 1)) 8 (- (select s0 8) 1)) 14 (+ (select s0 14) 1)) 6 (- (select s0 6) 1)) s1))")
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:512)
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 12:21:58] [INFO ] Built C files in 3643ms 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 1589545319375

--------------------
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="HexagonalGrid-PT-110"
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 HexagonalGrid-PT-110, 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-158940144600074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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