Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r439-smll-171690585600138.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is TriangularGrid-PT-1500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585600138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 04:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 04:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 9.7K May 18 16:43 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-1500-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-1500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717037329722

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-1500
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 02:48:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 02:48:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:48:53] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-30 02:48:53] [INFO ] Transformed 16 places.
[2024-05-30 02:48:53] [INFO ] Transformed 12 transitions.
[2024-05-30 02:48:53] [INFO ] Parsed PT model containing 16 places and 12 transitions and 48 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TriangularGrid-PT-1500-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 13 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2024-05-30 02:48:53] [INFO ] Computed 8 invariants in 8 ms
[2024-05-30 02:48:54] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-30 02:48:54] [INFO ] Invariant cache hit.
[2024-05-30 02:48:54] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-30 02:48:54] [INFO ] Invariant cache hit.
[2024-05-30 02:48:54] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 16/16 places, 12/12 transitions.
Support contains 16 out of 16 places after structural reductions.
[2024-05-30 02:48:54] [INFO ] Flatten gal took : 20 ms
[2024-05-30 02:48:54] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:48:54] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 15 properties in 14 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 1 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(X(G(p1)))&&p0))&&(X(G(p2))||G(p3)))))'
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 15 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:48:55] [INFO ] Invariant cache hit.
[2024-05-30 02:48:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 02:48:55] [INFO ] Invariant cache hit.
[2024-05-30 02:48:55] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-30 02:48:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 02:48:55] [INFO ] Invariant cache hit.
[2024-05-30 02:48:55] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 16/16 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 2110 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2, 3} source=0 dest: 0}, { cond=p0, acceptance={0, 1, 2, 3} source=0 dest: 1}, { cond=p0, acceptance={1, 2, 3} source=0 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0, 1, 2, 3} source=0 dest: 3}, { cond=(AND p0 p3), acceptance={0, 2, 3} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1, 2, 3} source=1 dest: 5}, { cond=p0, acceptance={0, 1, 2, 3} source=1 dest: 6}, { cond=p0, acceptance={1, 2, 3} source=1 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={0, 1, 2, 3} source=1 dest: 8}, { cond=(AND p0 p3), acceptance={0, 2, 3} source=1 dest: 9}], [{ cond=(NOT p0), acceptance={0, 1, 2, 3} source=2 dest: 0}, { cond=p0, acceptance={0, 1, 2, 3} source=2 dest: 1}, { cond=p0, acceptance={1, 2, 3} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2, 3} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2, 3} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1, 2, 3} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p3) p2)), acceptance={0, 1, 3} source=3 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1, 2, 3} source=3 dest: 3}, { cond=(AND p0 p3 p2), acceptance={0, 3} source=3 dest: 4}, { cond=(AND p0 p3 (NOT p2)), acceptance={0, 2, 3} source=3 dest: 4}, { cond=(AND p0 p3 p2), acceptance={0, 1, 3} source=3 dest: 10}, { cond=(AND p0 p3 p2), acceptance={1, 3} source=3 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1, 2, 3} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1, 2, 3} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1, 2, 3} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0, 1, 3} source=4 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1, 2, 3} source=4 dest: 3}, { cond=(AND p3 p2), acceptance={0, 3} source=4 dest: 4}, { cond=(AND p0 p3 (NOT p2)), acceptance={0, 2, 3} source=4 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0, 2, 3} source=4 dest: 12}, { cond=(AND p0 p3 (NOT p2)), acceptance={0, 2, 3} source=4 dest: 13}, { cond=(AND p0 p3 (NOT p2)), acceptance={2, 3} source=4 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2, 3} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1, 2, 3} source=5 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=5 dest: 3}, { cond=(AND p0 p3 (NOT p1)), acceptance={0, 2, 3} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={1, 2} source=5 dest: 7}, { cond=(AND p0 (NOT p3) p1), acceptance={0, 1, 2} source=5 dest: 8}, { cond=(AND p0 p3 p1), acceptance={0, 2} source=5 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2, 3} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={1, 2, 3} source=6 dest: 7}, { cond=(AND p0 (NOT p3) p1), acceptance={0, 1, 2} source=6 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=6 dest: 8}, { cond=(AND p0 p3 p1), acceptance={0, 2} source=6 dest: 9}, { cond=(AND p0 p3 (NOT p1)), acceptance={0, 2, 3} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2, 3} source=7 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1, 2, 3} source=7 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=8 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=8 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2, 3} source=8 dest: 2}, { cond=(OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p1))), acceptance={0, 1, 3} source=8 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=8 dest: 3}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={0, 3} source=8 dest: 4}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0, 2, 3} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=8 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=8 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={1, 2} source=8 dest: 7}, { cond=(OR (AND (NOT p0) p2 p1) (AND (NOT p3) p2 p1)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0, 1, 2} source=8 dest: 8}, { cond=(AND p0 p3 p2 p1), acceptance={0} source=8 dest: 9}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={0, 2} source=8 dest: 9}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={0, 1, 3} source=8 dest: 10}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={1, 3} source=8 dest: 11}, { cond=(AND p0 p3 p2 p1), acceptance={0, 1} source=8 dest: 15}, { cond=(AND p0 p3 p2 p1), acceptance={1} source=8 dest: 16}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=9 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=9 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={1, 2, 3} source=9 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0, 1, 3} source=9 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=9 dest: 3}, { cond=(AND p3 p2 (NOT p1)), acceptance={0, 3} source=9 dest: 4}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0, 2, 3} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0, 1, 2} source=9 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0, 1, 2} source=9 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={1, 2} source=9 dest: 7}, { cond=(AND (NOT p3) p2 p1), acceptance={0, 1} source=9 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0, 1, 2} source=9 dest: 8}, { cond=(AND p3 p2 p1), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={0, 2} source=9 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={0, 2, 3} source=9 dest: 12}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0, 2, 3} source=9 dest: 13}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={2, 3} source=9 dest: 14}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={0, 2} source=9 dest: 17}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={0, 2} source=9 dest: 18}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={2} source=9 dest: 19}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2, 3} source=10 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2, 3} source=10 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1, 2, 3} source=10 dest: 7}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p3) p2)), acceptance={0, 1, 3} source=10 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1, 2, 3} source=10 dest: 8}, { cond=(AND p0 p3 p2), acceptance={0, 3} source=10 dest: 9}, { cond=(AND p0 p3 (NOT p2)), acceptance={0, 2, 3} source=10 dest: 9}, { cond=(AND p0 p3 p2), acceptance={0, 1, 3} source=10 dest: 15}, { cond=(AND p0 p3 p2), acceptance={1, 3} source=10 dest: 16}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2, 3} source=11 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2, 3} source=11 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1, 2, 3} source=11 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 1, 3} source=11 dest: 3}, { cond=(AND p0 p2), acceptance={0, 1, 3} source=11 dest: 10}, { cond=(AND p0 p2), acceptance={1, 3} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1, 2, 3} source=12 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0, 1, 2, 3} source=12 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={1, 2, 3} source=12 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0, 1, 2, 3} source=12 dest: 3}, { cond=(AND p0 p3), acceptance={0, 2, 3} source=12 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={0, 2, 3} source=12 dest: 12}, { cond=(AND p0 p3), acceptance={0, 2, 3} source=12 dest: 13}, { cond=(AND p0 p3), acceptance={2, 3} source=12 dest: 14}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1, 2, 3} source=13 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={0, 1, 2, 3} source=13 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={1, 2, 3} source=13 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={0, 1, 2, 3} source=13 dest: 8}, { cond=(AND p0 p3), acceptance={0, 2, 3} source=13 dest: 9}, { cond=(AND (NOT p0) p3), acceptance={0, 2, 3} source=13 dest: 17}, { cond=(AND p0 p3), acceptance={0, 2, 3} source=13 dest: 18}, { cond=(AND p0 p3), acceptance={2, 3} source=13 dest: 19}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1, 2, 3} source=14 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0, 1, 2, 3} source=14 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={1, 2, 3} source=14 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={0, 2, 3} source=14 dest: 12}, { cond=(AND p0 p3), acceptance={0, 2, 3} source=14 dest: 13}, { cond=(AND p0 p3), acceptance={2, 3} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=15 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=15 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=15 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=15 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={1, 2} source=15 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2, 3} source=15 dest: 7}, { cond=(OR (AND (NOT p0) p2 p1) (AND (NOT p3) p2 p1)), acceptance={0, 1} source=15 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0, 1, 2} source=15 dest: 8}, { cond=(OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p1))), acceptance={0, 1, 3} source=15 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=15 dest: 8}, { cond=(AND p0 p3 p2 p1), acceptance={0} source=15 dest: 9}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={0, 2} source=15 dest: 9}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={0, 3} source=15 dest: 9}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0, 2, 3} source=15 dest: 9}, { cond=(AND p0 p3 p2 p1), acceptance={0, 1} source=15 dest: 15}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={0, 1, 3} source=15 dest: 15}, { cond=(AND p0 p3 p2 p1), acceptance={1} source=15 dest: 16}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={1, 3} source=15 dest: 16}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=16 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2, 3} source=16 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2, 3} source=16 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1, 3} source=16 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1, 3} source=16 dest: 10}, { cond=(AND p0 p2 (NOT p1)), acceptance={1, 3} source=16 dest: 11}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0, 1} source=16 dest: 15}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={1} source=16 dest: 16}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=17 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=17 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1, 2, 3} source=17 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=17 dest: 3}, { cond=(AND p0 p3 (NOT p1)), acceptance={0, 2, 3} source=17 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1, 2} source=17 dest: 5}, { cond=(AND p0 (NOT p3) p1), acceptance={0, 1, 2} source=17 dest: 6}, { cond=(AND p0 (NOT p3) p1), acceptance={1, 2} source=17 dest: 7}, { cond=(AND p0 (NOT p3) p1), acceptance={0, 1, 2} source=17 dest: 8}, { cond=(AND p0 p3 p1), acceptance={0, 2} source=17 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 2, 3} source=17 dest: 12}, { cond=(AND p0 p3 (NOT p1)), acceptance={0, 2, 3} source=17 dest: 13}, { cond=(AND p0 p3 (NOT p1)), acceptance={2, 3} source=17 dest: 14}, { cond=(AND (NOT p0) p3 p1), acceptance={0, 2} source=17 dest: 17}, { cond=(AND p0 p3 p1), acceptance={0, 2} source=17 dest: 18}, { cond=(AND p0 p3 p1), acceptance={2} source=17 dest: 19}], [{ cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={0, 1, 2} source=18 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=18 dest: 5}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0, 1, 2} source=18 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=18 dest: 6}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={1, 2} source=18 dest: 7}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1, 2, 3} source=18 dest: 7}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0, 1, 2} source=18 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=18 dest: 8}, { cond=(AND p0 p3 p2 p1), acceptance={0, 2} source=18 dest: 9}, { cond=(AND p0 p3 (NOT p1)), acceptance={0, 2, 3} source=18 dest: 9}, { cond=(AND (NOT p0) p3 p2 p1), acceptance={0, 2} source=18 dest: 17}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 2, 3} source=18 dest: 17}, { cond=(AND p0 p3 p2 p1), acceptance={0, 2} source=18 dest: 18}, { cond=(AND p0 p3 (NOT p1)), acceptance={0, 2, 3} source=18 dest: 18}, { cond=(AND p0 p3 p2 p1), acceptance={2} source=18 dest: 19}, { cond=(AND p0 p3 (NOT p1)), acceptance={2, 3} source=18 dest: 19}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={0, 1, 2, 3} source=19 dest: 0}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={0, 1, 2, 3} source=19 dest: 1}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={1, 2, 3} source=19 dest: 2}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={0, 2, 3} source=19 dest: 12}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={0, 2, 3} source=19 dest: 13}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={2, 3} source=19 dest: 14}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1)), p3:(AND (GEQ s9 1) (GEQ s12 1)), p2:(AND (GEQ s3 1) (GEQ s5 1)), p1:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1033 reset in 709 ms.
Stack based approach found an accepted trace after 143 steps with 0 reset with depth 144 and stack size 144 in 2 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-00 finished in 3196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:48:58] [INFO ] Invariant cache hit.
[2024-05-30 02:48:58] [INFO ] Implicit Places using invariants in 59 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 15/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s12 1)), p0:(AND (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-01 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:48:58] [INFO ] Invariant cache hit.
[2024-05-30 02:48:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 02:48:58] [INFO ] Invariant cache hit.
[2024-05-30 02:48:58] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-30 02:48:58] [INFO ] Invariant cache hit.
[2024-05-30 02:48:58] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(OR (LT s3 1) (LT s4 1) (AND (GEQ s3 1) (GEQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-03 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:48:58] [INFO ] Invariant cache hit.
[2024-05-30 02:48:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 02:48:58] [INFO ] Invariant cache hit.
[2024-05-30 02:48:58] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-30 02:48:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 02:48:59] [INFO ] Invariant cache hit.
[2024-05-30 02:48:59] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-05 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1 U X(p0)))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:48:59] [INFO ] Invariant cache hit.
[2024-05-30 02:48:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-30 02:48:59] [INFO ] Invariant cache hit.
[2024-05-30 02:48:59] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-30 02:48:59] [INFO ] Invariant cache hit.
[2024-05-30 02:48:59] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 12510 reset in 190 ms.
Stack based approach found an accepted trace after 130 steps with 17 reset with depth 8 and stack size 8 in 5 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-07 finished in 628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)||F(p2)))))'
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:48:59] [INFO ] Invariant cache hit.
[2024-05-30 02:49:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 02:49:00] [INFO ] Invariant cache hit.
[2024-05-30 02:49:00] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-30 02:49:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 02:49:00] [INFO ] Invariant cache hit.
[2024-05-30 02:49:00] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s9 1) (GEQ s12 1)), p1:(AND (GEQ s7 1) (GEQ s10 1)), p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12394 reset in 234 ms.
Stack based approach found an accepted trace after 884 steps with 102 reset with depth 19 and stack size 19 in 8 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-08 finished in 618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p2)&&p1))))'
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:49:00] [INFO ] Invariant cache hit.
[2024-05-30 02:49:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 02:49:00] [INFO ] Invariant cache hit.
[2024-05-30 02:49:00] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-30 02:49:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 02:49:00] [INFO ] Invariant cache hit.
[2024-05-30 02:49:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s12 1)), p1:(AND (GEQ s2 1) (GEQ s15 1)), p2:(OR (LT s9 1) (LT s12 1) (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-09 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:49:01] [INFO ] Invariant cache hit.
[2024-05-30 02:49:01] [INFO ] Implicit Places using invariants in 62 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 15/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21835 reset in 117 ms.
Stack based approach found an accepted trace after 189 steps with 40 reset with depth 9 and stack size 9 in 1 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-12 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&X(!p1)))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:49:01] [INFO ] Invariant cache hit.
[2024-05-30 02:49:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 02:49:01] [INFO ] Invariant cache hit.
[2024-05-30 02:49:01] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-30 02:49:01] [INFO ] Invariant cache hit.
[2024-05-30 02:49:01] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 146 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s6 1)), p1:(AND (GEQ s8 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32924 reset in 170 ms.
Stack based approach found an accepted trace after 15581 steps with 5184 reset with depth 14 and stack size 14 in 64 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-13 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-30 02:49:01] [INFO ] Invariant cache hit.
[2024-05-30 02:49:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 02:49:01] [INFO ] Invariant cache hit.
[2024-05-30 02:49:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-30 02:49:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 02:49:02] [INFO ] Invariant cache hit.
[2024-05-30 02:49:02] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 16/16 places, 12/12 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-1500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s12 1) (GEQ s3 1) (GEQ s5 1)), p1:(AND (GEQ s9 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 236 ms.
Stack based approach found an accepted trace after 64 steps with 7 reset with depth 13 and stack size 13 in 1 ms.
FORMULA TriangularGrid-PT-1500-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-1500-LTLFireability-14 finished in 595 ms.
All properties solved by simple procedures.
Total runtime 9268 ms.

BK_STOP 1717037343737

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-1500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5568"
echo " Executing tool gold2023"
echo " Input is TriangularGrid-PT-1500, 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 r439-smll-171690585600138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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