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.r153-tall-171631151400233.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 DiscoveryGPU-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151400233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.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.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 02:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 12 02:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 46K May 18 16:42 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 DiscoveryGPU-PT-06b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716420901002

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=DiscoveryGPU-PT-06b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:35:02] [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-22 23:35:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:35:02] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-22 23:35:02] [INFO ] Transformed 184 places.
[2024-05-22 23:35:02] [INFO ] Transformed 194 transitions.
[2024-05-22 23:35:02] [INFO ] Found NUPN structural information;
[2024-05-22 23:35:02] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 39 place count 145 transition count 167
Iterating global reduction 1 with 27 rules applied. Total rules applied 66 place count 145 transition count 167
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 139 transition count 161
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 139 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 136 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 136 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 134 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 134 transition count 156
Applied a total of 88 rules in 40 ms. Remains 134 /184 variables (removed 50) and now considering 156/194 (removed 38) transitions.
// Phase 1: matrix 156 rows 134 cols
[2024-05-22 23:35:03] [INFO ] Computed 2 invariants in 9 ms
[2024-05-22 23:35:03] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 23:35:03] [INFO ] Invariant cache hit.
[2024-05-22 23:35:03] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-22 23:35:03] [INFO ] Invariant cache hit.
[2024-05-22 23:35:03] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/184 places, 156/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 134/184 places, 156/194 transitions.
Support contains 34 out of 134 places after structural reductions.
[2024-05-22 23:35:03] [INFO ] Flatten gal took : 34 ms
[2024-05-22 23:35:03] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:35:03] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 33 out of 134 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 32) seen :27
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Finished Best-First random walk after 1768 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=589 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Graph (complete) has 261 edges and 134 vertex of which 131 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 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(p0)&&X(X(G(p1)))))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 124 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 119 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 112 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 112 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 109 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 106 transition count 123
Applied a total of 56 rules in 24 ms. Remains 106 /134 variables (removed 28) and now considering 123/156 (removed 33) transitions.
// Phase 1: matrix 123 rows 106 cols
[2024-05-22 23:35:04] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 23:35:04] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 23:35:04] [INFO ] Invariant cache hit.
[2024-05-22 23:35:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-22 23:35:05] [INFO ] Invariant cache hit.
[2024-05-22 23:35:05] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/134 places, 123/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 106/134 places, 123/156 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 306 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s34 1), p1:(EQ s72 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 339 steps with 1 reset in 10 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-00 finished in 629 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(p1)))||X(F(p2))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 126 transition count 146
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 126 transition count 146
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 121 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 121 transition count 141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 116 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 116 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 113 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 113 transition count 131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 110 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 110 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 107 transition count 124
Applied a total of 54 rules in 15 ms. Remains 107 /134 variables (removed 27) and now considering 124/156 (removed 32) transitions.
// Phase 1: matrix 124 rows 107 cols
[2024-05-22 23:35:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:35:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:35:05] [INFO ] Invariant cache hit.
[2024-05-22 23:35:05] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-22 23:35:05] [INFO ] Invariant cache hit.
[2024-05-22 23:35:05] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/134 places, 124/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 107/134 places, 124/156 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s89 1), p1:(EQ s89 0), p2:(AND (EQ s54 0) (EQ s73 0))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 212 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 20 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-01 finished in 815 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(((p0||X((G(p1) U (p0&&G(p1))))) U p1)))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 125 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 125 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 120 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 120 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 115 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 112 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 112 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 109 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 106 transition count 123
Applied a total of 56 rules in 19 ms. Remains 106 /134 variables (removed 28) and now considering 123/156 (removed 33) transitions.
// Phase 1: matrix 123 rows 106 cols
[2024-05-22 23:35:06] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 23:35:06] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 23:35:06] [INFO ] Invariant cache hit.
[2024-05-22 23:35:06] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-22 23:35:06] [INFO ] Invariant cache hit.
[2024-05-22 23:35:06] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/134 places, 123/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 106/134 places, 123/156 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s27 1), p0:(EQ s57 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-03 finished in 420 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||X(p1)))&&X(F((p2||G(p3))))))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 124 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 119 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 115 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 115 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 113 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 113 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 111 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 109 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 109 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 108 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 108 transition count 126
Applied a total of 52 rules in 18 ms. Remains 108 /134 variables (removed 26) and now considering 126/156 (removed 30) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-22 23:35:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:35:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 23:35:06] [INFO ] Invariant cache hit.
[2024-05-22 23:35:06] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-22 23:35:06] [INFO ] Invariant cache hit.
[2024-05-22 23:35:06] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/134 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 108/134 places, 126/156 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s86 0), p1:(EQ s38 1), p2:(EQ s27 1), p3:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 166 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-04 finished in 400 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 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Graph (complete) has 261 edges and 134 vertex of which 131 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 130 transition count 130
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 108 transition count 130
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 45 place count 108 transition count 112
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 81 place count 90 transition count 112
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 86 transition count 106
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 86 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 83 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 83 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 82 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 82 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 81 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 81 transition count 100
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 165 place count 48 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 44 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 44 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 40 transition count 55
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 40 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 36 transition count 47
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 36 transition count 47
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 193 place count 32 transition count 43
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 32 transition count 43
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 28 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 28 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 24 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 22 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 220 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 227 place count 15 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 231 place count 11 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 237 place count 8 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 6 transition count 11
Applied a total of 241 rules in 53 ms. Remains 6 /134 variables (removed 128) and now considering 11/156 (removed 145) transitions.
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-22 23:35:07] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 23:35:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 23:35:07] [INFO ] Invariant cache hit.
[2024-05-22 23:35:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 23:35:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 23:35:07] [INFO ] Invariant cache hit.
[2024-05-22 23:35:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/134 places, 11/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 6/134 places, 11/156 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-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:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-05 finished in 171 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(p0) U (p1||G(F(p2))||G(p3))))'
Support contains 6 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Graph (complete) has 261 edges and 134 vertex of which 132 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 131 transition count 134
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 112 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 110 transition count 132
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 43 place count 110 transition count 115
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 77 place count 93 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 89 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 89 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 86 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 86 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 84 transition count 102
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 84 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 82 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 82 transition count 100
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 153 place count 55 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 156 place count 52 transition count 67
Iterating global reduction 3 with 3 rules applied. Total rules applied 159 place count 52 transition count 67
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 49 transition count 64
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 49 transition count 64
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 46 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 46 transition count 58
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 43 transition count 55
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 43 transition count 55
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 179 place count 41 transition count 51
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 41 transition count 51
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 39 transition count 49
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 39 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 38 transition count 49
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 38 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 36 transition count 47
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 60 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 195 place count 34 transition count 43
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 199 place count 31 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 200 place count 30 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 208 place count 26 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 210 place count 25 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 211 place count 24 transition count 36
Applied a total of 211 rules in 35 ms. Remains 24 /134 variables (removed 110) and now considering 36/156 (removed 120) transitions.
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 24 cols
[2024-05-22 23:35:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:35:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-22 23:35:07] [INFO ] Invariant cache hit.
[2024-05-22 23:35:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-22 23:35:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-22 23:35:07] [INFO ] Invariant cache hit.
[2024-05-22 23:35:07] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/134 places, 36/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 24/134 places, 36/156 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s17 1) (EQ s23 1)), p2:(AND (EQ s5 1) (EQ s10 1) (EQ s23 1)), p3:(EQ s8 1), p0:(OR (EQ s5 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-07 finished in 485 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((G(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Graph (complete) has 261 edges and 134 vertex of which 131 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 130 transition count 133
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 111 transition count 133
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 39 place count 111 transition count 116
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 73 place count 94 transition count 116
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 88 transition count 108
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 88 transition count 108
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 84 transition count 104
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 84 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 81 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 81 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 78 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 78 transition count 95
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 161 place count 50 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 164 place count 47 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 47 transition count 61
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 44 transition count 58
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 44 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 176 place count 41 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 179 place count 41 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 39 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 39 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 185 place count 37 transition count 46
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 37 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 189 place count 35 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 35 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 32 transition count 42
Applied a total of 195 rules in 30 ms. Remains 32 /134 variables (removed 102) and now considering 42/156 (removed 114) transitions.
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 32 cols
[2024-05-22 23:35:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:35:07] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 23:35:07] [INFO ] Invariant cache hit.
[2024-05-22 23:35:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:35:07] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-22 23:35:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:35:07] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 23:35:07] [INFO ] Invariant cache hit.
[2024-05-22 23:35:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/134 places, 42/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 32/134 places, 42/156 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s18 1) (EQ s31 1))) (NOT (AND (EQ s4 1) (EQ s31 1)))), p1:(AND (EQ s4 1) (EQ s31 1)), p0:(OR (EQ s24 0) (EQ s29 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1209 reset in 263 ms.
Stack based approach found an accepted trace after 10830 steps with 127 reset with depth 78 and stack size 71 in 22 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-08 finished in 558 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((p0&&X(G((p1&&(p2 U p3)))))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 126 transition count 146
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 122 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 122 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 118 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 118 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 116 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 116 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 114 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 114 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 112 transition count 130
Applied a total of 44 rules in 11 ms. Remains 112 /134 variables (removed 22) and now considering 130/156 (removed 26) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-22 23:35:08] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:35:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 23:35:08] [INFO ] Invariant cache hit.
[2024-05-22 23:35:08] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-22 23:35:08] [INFO ] Invariant cache hit.
[2024-05-22 23:35:08] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/134 places, 130/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 112/134 places, 130/156 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s108 0) (EQ s55 0)), p1:(EQ s55 1), p3:(AND (EQ s53 1) (EQ s108 1)), p2:(EQ s20 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-10 finished in 428 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(G(p0))))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 125 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 125 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 121 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 121 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 117 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 117 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 114 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 109 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 109 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 108 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 108 transition count 126
Applied a total of 52 rules in 18 ms. Remains 108 /134 variables (removed 26) and now considering 126/156 (removed 30) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-22 23:35:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:35:08] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 23:35:08] [INFO ] Invariant cache hit.
[2024-05-22 23:35:08] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-22 23:35:08] [INFO ] Invariant cache hit.
[2024-05-22 23:35:08] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/134 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 108/134 places, 126/156 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 196 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-11 finished in 347 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)))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 124 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 119 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 114 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 108 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 105 transition count 122
Applied a total of 58 rules in 9 ms. Remains 105 /134 variables (removed 29) and now considering 122/156 (removed 34) transitions.
// Phase 1: matrix 122 rows 105 cols
[2024-05-22 23:35:09] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 23:35:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:35:09] [INFO ] Invariant cache hit.
[2024-05-22 23:35:09] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-22 23:35:09] [INFO ] Invariant cache hit.
[2024-05-22 23:35:09] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/134 places, 122/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 105/134 places, 122/156 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-12 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 (EQ s45 1) (EQ s101 1) (EQ s88 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]]
Stuttering criterion allowed to conclude after 205 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-12 finished in 285 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(p0) U X(X(p1))))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 125 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 125 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 120 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 120 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 115 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 112 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 112 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 109 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 107 transition count 124
Applied a total of 54 rules in 15 ms. Remains 107 /134 variables (removed 27) and now considering 124/156 (removed 32) transitions.
// Phase 1: matrix 124 rows 107 cols
[2024-05-22 23:35:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:35:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:35:09] [INFO ] Invariant cache hit.
[2024-05-22 23:35:09] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-22 23:35:09] [INFO ] Invariant cache hit.
[2024-05-22 23:35:09] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/134 places, 124/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 107/134 places, 124/156 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s54 1), p1:(AND (EQ s59 1) (EQ s54 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2483 reset in 216 ms.
Stack based approach found an accepted trace after 96 steps with 1 reset with depth 56 and stack size 56 in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-13 finished in 821 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' '!(((p0 U p1) U X(X((!p2||F(G(p3)))))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 125 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 125 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 121 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 121 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 117 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 117 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 114 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 109 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 109 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 108 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 108 transition count 126
Applied a total of 52 rules in 10 ms. Remains 108 /134 variables (removed 26) and now considering 126/156 (removed 30) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-22 23:35:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:35:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:35:10] [INFO ] Invariant cache hit.
[2024-05-22 23:35:10] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-22 23:35:10] [INFO ] Invariant cache hit.
[2024-05-22 23:35:10] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/134 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 108/134 places, 126/156 transitions.
Stuttering acceptance computed with spot in 528 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 8}, { cond=(OR p1 p0), acceptance={} source=3 dest: 9}], [{ cond=p2, acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={} source=5 dest: 5}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 10}], [{ cond=p2, acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=9 dest: 8}, { cond=(OR (AND p1 p2 p3) (AND p0 p2 p3)), acceptance={} source=9 dest: 9}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p1:(EQ s13 1), p0:(AND (EQ s13 1) (EQ s27 1)), p2:(EQ s27 1), p3:(NEQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 161 ms.
Product exploration explored 100000 steps with 33333 reset in 153 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 216 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/108 stabilizing places and 20/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (OR (AND p1 p2 p3) (AND p0 p2 p3))))), (X (X (NOT (OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 11 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-14 finished in 1085 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(p0)||X((p1||X(F(p2))))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 124 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 124 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 119 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 119 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 114 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 111 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 108 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 105 transition count 122
Applied a total of 58 rules in 9 ms. Remains 105 /134 variables (removed 29) and now considering 122/156 (removed 34) transitions.
// Phase 1: matrix 122 rows 105 cols
[2024-05-22 23:35:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:35:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 23:35:11] [INFO ] Invariant cache hit.
[2024-05-22 23:35:11] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-22 23:35:11] [INFO ] Invariant cache hit.
[2024-05-22 23:35:11] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/134 places, 122/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 105/134 places, 122/156 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s40 1) (EQ s101 1)), p1:(EQ s5 0), p2:(AND (EQ s50 1) (EQ s104 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 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 210 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/105 stabilizing places and 20/122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-15 finished in 564 ms.
All properties solved by simple procedures.
Total runtime 9248 ms.

BK_STOP 1716420912815

--------------------
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="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r153-tall-171631151400233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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