Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410700324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DiscoveryGPU-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410700324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:22 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-08b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678422638766

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 04:30:42] [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]
[2023-03-10 04:30:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 04:30:42] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-10 04:30:42] [INFO ] Transformed 240 places.
[2023-03-10 04:30:42] [INFO ] Transformed 254 transitions.
[2023-03-10 04:30:42] [INFO ] Found NUPN structural information;
[2023-03-10 04:30:42] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 51 place count 189 transition count 219
Iterating global reduction 1 with 35 rules applied. Total rules applied 86 place count 189 transition count 219
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 181 transition count 211
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 181 transition count 211
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 176 transition count 206
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 176 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 172 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 172 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 170 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 170 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 168 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 168 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 166 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 166 transition count 194
Applied a total of 132 rules in 136 ms. Remains 166 /240 variables (removed 74) and now considering 194/254 (removed 60) transitions.
// Phase 1: matrix 194 rows 166 cols
[2023-03-10 04:30:42] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-10 04:30:43] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-10 04:30:43] [INFO ] Invariant cache hit.
[2023-03-10 04:30:43] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2023-03-10 04:30:43] [INFO ] Invariant cache hit.
[2023-03-10 04:30:44] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/240 places, 194/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1413 ms. Remains : 166/240 places, 194/254 transitions.
Support contains 35 out of 166 places after structural reductions.
[2023-03-10 04:30:44] [INFO ] Flatten gal took : 94 ms
[2023-03-10 04:30:44] [INFO ] Flatten gal took : 33 ms
[2023-03-10 04:30:44] [INFO ] Input system was already deterministic with 194 transitions.
Support contains 33 out of 166 places (down from 35) after GAL structural reductions.
Finished random walk after 1640 steps, including 6 resets, run visited all 29 properties in 233 ms. (steps per millisecond=7 )
FORMULA DiscoveryGPU-PT-08b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 323 edges and 166 vertex of which 160 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Graph (complete) has 323 edges and 166 vertex of which 160 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 159 transition count 163
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 135 transition count 163
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 49 place count 135 transition count 136
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 103 place count 108 transition count 136
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 108 place count 103 transition count 129
Iterating global reduction 2 with 5 rules applied. Total rules applied 113 place count 103 transition count 129
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 99 transition count 125
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 99 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 97 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 95 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 95 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 94 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 94 transition count 118
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 203 place count 58 transition count 82
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 209 place count 52 transition count 71
Iterating global reduction 2 with 6 rules applied. Total rules applied 215 place count 52 transition count 71
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 221 place count 46 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 227 place count 46 transition count 64
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 233 place count 40 transition count 52
Iterating global reduction 2 with 6 rules applied. Total rules applied 239 place count 40 transition count 52
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 245 place count 34 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 251 place count 34 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 257 place count 28 transition count 34
Iterating global reduction 2 with 6 rules applied. Total rules applied 263 place count 28 transition count 34
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 269 place count 22 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 275 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 276 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 277 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 278 place count 20 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 20 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 282 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 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 289 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 293 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 297 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 300 place count 5 transition count 10
Applied a total of 300 rules in 94 ms. Remains 5 /166 variables (removed 161) and now considering 10/194 (removed 184) transitions.
[2023-03-10 04:30:45] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-10 04:30:45] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 04:30:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 04:30:45] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-10 04:30:45] [INFO ] Invariant cache hit.
[2023-03-10 04:30:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 04:30:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:30:45] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-10 04:30:45] [INFO ] Invariant cache hit.
[2023-03-10 04:30:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/166 places, 10/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 5/166 places, 10/194 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-00 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 s4 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 32 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-00 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U ((F(p0)&&G(p1)) U (p0 U p2))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 155 transition count 181
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 155 transition count 181
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 150 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 150 transition count 176
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 146 transition count 172
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 146 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 144 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 144 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 140 transition count 164
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 138 transition count 162
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 138 transition count 162
Applied a total of 56 rules in 37 ms. Remains 138 /166 variables (removed 28) and now considering 162/194 (removed 32) transitions.
// Phase 1: matrix 162 rows 138 cols
[2023-03-10 04:30:46] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-10 04:30:46] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-10 04:30:46] [INFO ] Invariant cache hit.
[2023-03-10 04:30:46] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-10 04:30:46] [INFO ] Invariant cache hit.
[2023-03-10 04:30:46] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/166 places, 162/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 138/166 places, 162/194 transitions.
Stuttering acceptance computed with spot in 638 ms :[(NOT p2), p0, (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(EQ s15 1), p0:(AND (EQ s68 1) (EQ s134 1)), p1:(EQ s123 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][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-01 finished in 1258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((p1 U p2) U X(G(!p3)))&&p0))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 182
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 182
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 151 transition count 177
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 146 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 146 transition count 171
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 143 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 143 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 140 transition count 163
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 140 transition count 163
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 138 transition count 161
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 138 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 136 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 136 transition count 159
Applied a total of 60 rules in 46 ms. Remains 136 /166 variables (removed 30) and now considering 159/194 (removed 35) transitions.
// Phase 1: matrix 159 rows 136 cols
[2023-03-10 04:30:47] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-10 04:30:47] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-10 04:30:47] [INFO ] Invariant cache hit.
[2023-03-10 04:30:47] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-10 04:30:47] [INFO ] Invariant cache hit.
[2023-03-10 04:30:47] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/166 places, 159/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 136/166 places, 159/194 transitions.
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), true, p3, (AND (NOT p2) p3), p3, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s132 1) (EQ s106 1)), p2:(AND (EQ s84 1) (EQ s132 1)), p1:(AND (EQ s23 1) (EQ s132 1)), p3:(AND (EQ s28 1) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-02 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&G(!p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 152 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 152 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 148 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 148 transition count 174
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 145 transition count 171
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 145 transition count 171
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 142 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 140 transition count 164
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 138 transition count 162
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 138 transition count 162
Applied a total of 56 rules in 23 ms. Remains 138 /166 variables (removed 28) and now considering 162/194 (removed 32) transitions.
// Phase 1: matrix 162 rows 138 cols
[2023-03-10 04:30:48] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-10 04:30:48] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-10 04:30:48] [INFO ] Invariant cache hit.
[2023-03-10 04:30:48] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-10 04:30:48] [INFO ] Invariant cache hit.
[2023-03-10 04:30:48] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/166 places, 162/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 138/166 places, 162/194 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), p0]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s32 1), p1:(EQ s70 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 242 steps with 0 reset in 8 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-04 finished in 699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 155 transition count 181
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 155 transition count 181
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 150 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 150 transition count 176
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 145 transition count 170
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 145 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 142 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 142 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 139 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 139 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 137 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 137 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 135 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 135 transition count 158
Applied a total of 62 rules in 19 ms. Remains 135 /166 variables (removed 31) and now considering 158/194 (removed 36) transitions.
// Phase 1: matrix 158 rows 135 cols
[2023-03-10 04:30:49] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 04:30:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-10 04:30:49] [INFO ] Invariant cache hit.
[2023-03-10 04:30:49] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-10 04:30:49] [INFO ] Invariant cache hit.
[2023-03-10 04:30:49] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/166 places, 158/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 135/166 places, 158/194 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s39 0)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 104 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-05 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Graph (complete) has 323 edges and 166 vertex of which 161 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 160 transition count 165
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 137 transition count 165
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 47 place count 137 transition count 139
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 99 place count 111 transition count 139
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 106 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 106 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 102 transition count 128
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 102 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 100 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 100 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 99 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 99 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 98 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 98 transition count 122
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 195 place count 63 transition count 87
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 201 place count 57 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 207 place count 57 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 212 place count 52 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 217 place count 52 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 221 place count 48 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 48 transition count 63
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 229 place count 44 transition count 59
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 44 transition count 59
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 237 place count 40 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 241 place count 40 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 245 place count 36 transition count 47
Iterating global reduction 2 with 4 rules applied. Total rules applied 249 place count 36 transition count 47
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 251 place count 35 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 252 place count 34 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 34 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 33 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 33 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 32 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 32 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 258 place count 31 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 259 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 30 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 30 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 29 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 28 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 28 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 266 place count 28 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 26 transition count 34
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 42 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 271 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 23 transition count 32
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 280 place count 19 transition count 28
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 283 place count 16 transition count 25
Applied a total of 283 rules in 91 ms. Remains 16 /166 variables (removed 150) and now considering 25/194 (removed 169) transitions.
[2023-03-10 04:30:49] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 16 cols
[2023-03-10 04:30:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 04:30:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 04:30:49] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2023-03-10 04:30:49] [INFO ] Invariant cache hit.
[2023-03-10 04:30:49] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-10 04:30:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:30:49] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2023-03-10 04:30:49] [INFO ] Invariant cache hit.
[2023-03-10 04:30:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/166 places, 25/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 16/166 places, 25/194 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-06 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:(EQ s11 0), p1:(OR (EQ s3 0) (EQ s15 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-06 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(F(p0)))||(X(p1) U p2))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 182
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 182
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 151 transition count 177
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 146 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 146 transition count 171
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 143 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 143 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 141 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 141 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 140 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 139 transition count 163
Applied a total of 54 rules in 15 ms. Remains 139 /166 variables (removed 27) and now considering 163/194 (removed 31) transitions.
// Phase 1: matrix 163 rows 139 cols
[2023-03-10 04:30:49] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 04:30:50] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-10 04:30:50] [INFO ] Invariant cache hit.
[2023-03-10 04:30:50] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-10 04:30:50] [INFO ] Invariant cache hit.
[2023-03-10 04:30:50] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/166 places, 163/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 139/166 places, 163/194 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s113 1), p0:(OR (EQ s125 0) (EQ s135 0) (EQ s113 1)), p1:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33379 reset in 435 ms.
Product exploration explored 100000 steps with 33351 reset in 281 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 396 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :3
Finished Best-First random walk after 1531 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=255 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 579 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2023-03-10 04:30:52] [INFO ] Invariant cache hit.
[2023-03-10 04:30:52] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-10 04:30:52] [INFO ] Invariant cache hit.
[2023-03-10 04:30:53] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-10 04:30:53] [INFO ] Invariant cache hit.
[2023-03-10 04:30:53] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 139/139 places, 163/163 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 359 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Finished random walk after 8202 steps, including 32 resets, run visited all 4 properties in 48 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 488 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33449 reset in 268 ms.
Product exploration explored 100000 steps with 33310 reset in 307 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 138 transition count 162
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 17 place count 138 transition count 162
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 42 place count 138 transition count 162
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 63 place count 138 transition count 170
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 136 transition count 168
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 136 transition count 168
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 136 transition count 200
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 89 place count 130 transition count 188
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 95 place count 130 transition count 188
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 113 place count 112 transition count 158
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 131 place count 112 transition count 158
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 148 place count 95 transition count 130
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 165 place count 95 transition count 130
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 170 place count 90 transition count 125
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 175 place count 90 transition count 125
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 183 place count 82 transition count 113
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 191 place count 82 transition count 113
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 207 place count 66 transition count 89
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 223 place count 66 transition count 89
Deduced a syphon composed of 36 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 225 place count 66 transition count 87
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 225 rules in 39 ms. Remains 66 /139 variables (removed 73) and now considering 87/163 (removed 76) transitions.
[2023-03-10 04:30:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 04:30:55] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 66 cols
[2023-03-10 04:30:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 04:30:55] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/139 places, 87/163 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 66/139 places, 87/163 transitions.
Built C files in :
/tmp/ltsmin1750659597190972128
[2023-03-10 04:30:55] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1750659597190972128
Running compilation step : cd /tmp/ltsmin1750659597190972128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 633 ms.
Running link step : cd /tmp/ltsmin1750659597190972128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1750659597190972128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17855004694644144397.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 139 cols
[2023-03-10 04:31:10] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 04:31:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-10 04:31:11] [INFO ] Invariant cache hit.
[2023-03-10 04:31:11] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-10 04:31:11] [INFO ] Invariant cache hit.
[2023-03-10 04:31:11] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 139/139 places, 163/163 transitions.
Built C files in :
/tmp/ltsmin3058888345676095104
[2023-03-10 04:31:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3058888345676095104
Running compilation step : cd /tmp/ltsmin3058888345676095104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 536 ms.
Running link step : cd /tmp/ltsmin3058888345676095104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3058888345676095104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8259335777928401647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 04:31:26] [INFO ] Flatten gal took : 14 ms
[2023-03-10 04:31:26] [INFO ] Flatten gal took : 11 ms
[2023-03-10 04:31:26] [INFO ] Time to serialize gal into /tmp/LTL11940394227081450114.gal : 5 ms
[2023-03-10 04:31:26] [INFO ] Time to serialize properties into /tmp/LTL8089416287152986040.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11940394227081450114.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13648809372629260920.hoa' '-atoms' '/tmp/LTL8089416287152986040.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8089416287152986040.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13648809372629260920.hoa
Detected timeout of ITS tools.
[2023-03-10 04:31:41] [INFO ] Flatten gal took : 12 ms
[2023-03-10 04:31:41] [INFO ] Flatten gal took : 10 ms
[2023-03-10 04:31:41] [INFO ] Time to serialize gal into /tmp/LTL3150711974417167460.gal : 3 ms
[2023-03-10 04:31:41] [INFO ] Time to serialize properties into /tmp/LTL16528484327591805150.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3150711974417167460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16528484327591805150.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(((p217==0)||(p231==0))||(p192==1))"))))||((X("(p146==1)"))U("(p192==1)")))))
Formula 0 simplified : F(!"(p192==1)" & X(G!"(((p217==0)||(p231==0))||(p192==1))" & (!"(p192==1)" W !"(p146==1)")))
Detected timeout of ITS tools.
[2023-03-10 04:31:56] [INFO ] Flatten gal took : 10 ms
[2023-03-10 04:31:56] [INFO ] Applying decomposition
[2023-03-10 04:31:56] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7357449801349924521.txt' '-o' '/tmp/graph7357449801349924521.bin' '-w' '/tmp/graph7357449801349924521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7357449801349924521.bin' '-l' '-1' '-v' '-w' '/tmp/graph7357449801349924521.weights' '-q' '0' '-e' '0.001'
[2023-03-10 04:31:56] [INFO ] Decomposing Gal with order
[2023-03-10 04:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 04:31:56] [INFO ] Removed a total of 61 redundant transitions.
[2023-03-10 04:31:56] [INFO ] Flatten gal took : 59 ms
[2023-03-10 04:31:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 6 ms.
[2023-03-10 04:31:56] [INFO ] Time to serialize gal into /tmp/LTL4823007460144998502.gal : 6 ms
[2023-03-10 04:31:56] [INFO ] Time to serialize properties into /tmp/LTL14919789676652577964.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4823007460144998502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14919789676652577964.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(((i13.u45.p217==0)||(u48.p231==0))||(i12.u40.p192==1))"))))||((X("(i1.u6.p146==1)"))U("(i12.u40.p192==1)")))))
Formula 0 simplified : F(!"(i12.u40.p192==1)" & X(G!"(((i13.u45.p217==0)||(u48.p231==0))||(i12.u40.p192==1))" & (!"(i12.u40.p192==1)" W !"(i1.u6.p146==1)")...157
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14583479382553650235
[2023-03-10 04:32:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14583479382553650235
Running compilation step : cd /tmp/ltsmin14583479382553650235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 359 ms.
Running link step : cd /tmp/ltsmin14583479382553650235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14583479382553650235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(X(<>((LTLAPp0==true))))||(X((LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-07 finished in 97116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||(p1 U p2)))&&F(G((p3||F(p2)))))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Graph (complete) has 323 edges and 166 vertex of which 160 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 159 transition count 164
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 136 transition count 164
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 47 place count 136 transition count 139
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 97 place count 111 transition count 139
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 106 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 106 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 102 transition count 128
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 102 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 100 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 100 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 98 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 98 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 97 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 97 transition count 121
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 195 place count 62 transition count 86
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 57 transition count 77
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 57 transition count 77
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 210 place count 52 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 215 place count 52 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 220 place count 47 transition count 61
Iterating global reduction 2 with 5 rules applied. Total rules applied 225 place count 47 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 230 place count 42 transition count 56
Iterating global reduction 2 with 5 rules applied. Total rules applied 235 place count 42 transition count 56
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 240 place count 37 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 245 place count 37 transition count 46
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 249 place count 33 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 253 place count 33 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 32 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 32 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 31 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 31 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 31 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 259 place count 31 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 261 place count 29 transition count 36
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 263 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 27 transition count 35
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 264 place count 27 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 272 place count 23 transition count 31
Applied a total of 272 rules in 35 ms. Remains 23 /166 variables (removed 143) and now considering 31/194 (removed 163) transitions.
[2023-03-10 04:32:27] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 23 cols
[2023-03-10 04:32:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 04:32:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 04:32:27] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2023-03-10 04:32:27] [INFO ] Invariant cache hit.
[2023-03-10 04:32:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 04:32:27] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-10 04:32:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 04:32:27] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2023-03-10 04:32:27] [INFO ] Invariant cache hit.
[2023-03-10 04:32:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/166 places, 31/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 23/166 places, 31/194 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s22 1)), p2:(EQ s16 1), p3:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-08 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||G(p1)))&&F(p2)))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 155 transition count 181
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 155 transition count 181
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 150 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 150 transition count 176
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 145 transition count 170
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 145 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 142 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 142 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 139 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 139 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 137 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 137 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 135 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 135 transition count 158
Applied a total of 62 rules in 51 ms. Remains 135 /166 variables (removed 31) and now considering 158/194 (removed 36) transitions.
// Phase 1: matrix 158 rows 135 cols
[2023-03-10 04:32:27] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 04:32:27] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-10 04:32:27] [INFO ] Invariant cache hit.
[2023-03-10 04:32:27] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-10 04:32:27] [INFO ] Invariant cache hit.
[2023-03-10 04:32:27] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/166 places, 158/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 135/166 places, 158/194 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s78 0), p0:(EQ s68 1), p1:(EQ s109 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-10 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 157 transition count 183
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 157 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 153 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 153 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 149 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 149 transition count 174
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 147 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 147 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 145 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 145 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 144 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 144 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 143 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 143 transition count 167
Applied a total of 46 rules in 27 ms. Remains 143 /166 variables (removed 23) and now considering 167/194 (removed 27) transitions.
// Phase 1: matrix 167 rows 143 cols
[2023-03-10 04:32:28] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 04:32:28] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 04:32:28] [INFO ] Invariant cache hit.
[2023-03-10 04:32:28] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-10 04:32:28] [INFO ] Invariant cache hit.
[2023-03-10 04:32:28] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/166 places, 167/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 143/166 places, 167/194 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s82 1) (EQ s139 1)), p0:(AND (EQ s127 0) (EQ s61 1) (OR (EQ s87 0) (EQ s142 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][false, false, false]]
Stuttering criterion allowed to conclude after 222 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-11 finished in 691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 152 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 152 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 148 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 148 transition count 174
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 145 transition count 171
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 145 transition count 171
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 142 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 140 transition count 164
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 138 transition count 162
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 138 transition count 162
Applied a total of 56 rules in 20 ms. Remains 138 /166 variables (removed 28) and now considering 162/194 (removed 32) transitions.
// Phase 1: matrix 162 rows 138 cols
[2023-03-10 04:32:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 04:32:29] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-10 04:32:29] [INFO ] Invariant cache hit.
[2023-03-10 04:32:29] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-10 04:32:29] [INFO ] Invariant cache hit.
[2023-03-10 04:32:29] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/166 places, 162/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 138/166 places, 162/194 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s116 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 193 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-12 finished in 744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Graph (complete) has 323 edges and 166 vertex of which 160 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 159 transition count 164
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 136 transition count 164
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 47 place count 136 transition count 138
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 99 place count 110 transition count 138
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 106 transition count 132
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 106 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 102 transition count 128
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 102 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 100 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 100 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 99 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 99 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 98 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 98 transition count 123
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 197 place count 61 transition count 86
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 55 transition count 74
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 55 transition count 74
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 215 place count 49 transition count 67
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 49 transition count 67
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 226 place count 44 transition count 58
Iterating global reduction 2 with 5 rules applied. Total rules applied 231 place count 44 transition count 58
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 236 place count 39 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 241 place count 39 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 246 place count 34 transition count 43
Iterating global reduction 2 with 5 rules applied. Total rules applied 251 place count 34 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 256 place count 29 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 261 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 28 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 28 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 28 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 28 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 29 edges and 24 vertex of which 21 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 274 place count 21 transition count 26
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 278 place count 17 transition count 26
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 288 place count 12 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 293 place count 9 transition count 16
Applied a total of 293 rules in 45 ms. Remains 9 /166 variables (removed 157) and now considering 16/194 (removed 178) transitions.
[2023-03-10 04:32:29] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2023-03-10 04:32:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 04:32:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 04:32:29] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-10 04:32:29] [INFO ] Invariant cache hit.
[2023-03-10 04:32:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 04:32:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:32:29] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2023-03-10 04:32:29] [INFO ] Invariant cache hit.
[2023-03-10 04:32:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/166 places, 16/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 9/166 places, 16/194 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s7 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-14 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Graph (complete) has 323 edges and 166 vertex of which 160 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 159 transition count 164
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 136 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 135 transition count 163
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 49 place count 135 transition count 137
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 101 place count 109 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 104 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 104 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 100 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 100 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 98 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 98 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 96 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 96 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 95 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 95 transition count 119
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 201 place count 59 transition count 83
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 208 place count 52 transition count 70
Iterating global reduction 3 with 7 rules applied. Total rules applied 215 place count 52 transition count 70
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 222 place count 45 transition count 62
Iterating global reduction 3 with 7 rules applied. Total rules applied 229 place count 45 transition count 62
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 234 place count 40 transition count 52
Iterating global reduction 3 with 5 rules applied. Total rules applied 239 place count 40 transition count 52
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 244 place count 35 transition count 47
Iterating global reduction 3 with 5 rules applied. Total rules applied 249 place count 35 transition count 47
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 30 transition count 37
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 30 transition count 37
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 264 place count 25 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 269 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 24 transition count 30
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 23 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 23 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 274 place count 23 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 278 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 279 place count 19 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 279 place count 19 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 285 place count 16 transition count 22
Applied a total of 285 rules in 27 ms. Remains 16 /166 variables (removed 150) and now considering 22/194 (removed 172) transitions.
[2023-03-10 04:32:29] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 16 cols
[2023-03-10 04:32:29] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 04:32:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-10 04:32:30] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-10 04:32:30] [INFO ] Invariant cache hit.
[2023-03-10 04:32:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 04:32:30] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-10 04:32:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:32:30] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-10 04:32:30] [INFO ] Invariant cache hit.
[2023-03-10 04:32:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/166 places, 22/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 16/166 places, 22/194 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-15 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 (EQ s8 1) (EQ s15 1) (EQ s12 0))], 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 95 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-15 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(F(p0)))||(X(p1) U p2))))'
Found a Lengthening insensitive property : DiscoveryGPU-PT-08b-LTLFireability-07
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 166/166 places, 194/194 transitions.
Graph (complete) has 323 edges and 166 vertex of which 160 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 159 transition count 165
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 137 transition count 165
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 45 place count 137 transition count 139
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 97 place count 111 transition count 139
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 106 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 106 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 102 transition count 128
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 102 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 100 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 100 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 99 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 99 transition count 124
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 193 place count 63 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 199 place count 57 transition count 77
Iterating global reduction 2 with 6 rules applied. Total rules applied 205 place count 57 transition count 77
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 211 place count 51 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 217 place count 51 transition count 70
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 222 place count 46 transition count 60
Iterating global reduction 2 with 5 rules applied. Total rules applied 227 place count 46 transition count 60
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 232 place count 41 transition count 55
Iterating global reduction 2 with 5 rules applied. Total rules applied 237 place count 41 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 241 place count 37 transition count 47
Iterating global reduction 2 with 4 rules applied. Total rules applied 245 place count 37 transition count 47
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 249 place count 33 transition count 43
Iterating global reduction 2 with 4 rules applied. Total rules applied 253 place count 33 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 32 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 31 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 31 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 31 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 261 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 28 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 262 place count 28 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 26 transition count 36
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 272 place count 23 transition count 32
Applied a total of 272 rules in 31 ms. Remains 23 /166 variables (removed 143) and now considering 32/194 (removed 162) transitions.
[2023-03-10 04:32:30] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 23 cols
[2023-03-10 04:32:30] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 04:32:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-10 04:32:30] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2023-03-10 04:32:30] [INFO ] Invariant cache hit.
[2023-03-10 04:32:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 04:32:30] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-10 04:32:30] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2023-03-10 04:32:30] [INFO ] Invariant cache hit.
[2023-03-10 04:32:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 23/166 places, 32/194 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 175 ms. Remains : 23/166 places, 32/194 transitions.
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s15 1), p0:(OR (EQ s19 0) (EQ s22 0) (EQ s15 1)), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33229 reset in 211 ms.
Product exploration explored 100000 steps with 33279 reset in 243 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/23 stabilizing places and 25/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 399 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Finished random walk after 3296 steps, including 35 resets, run visited all 4 properties in 18 ms. (steps per millisecond=183 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 649 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-10 04:32:32] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2023-03-10 04:32:32] [INFO ] Invariant cache hit.
[2023-03-10 04:32:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-10 04:32:32] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2023-03-10 04:32:32] [INFO ] Invariant cache hit.
[2023-03-10 04:32:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 04:32:32] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-10 04:32:32] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2023-03-10 04:32:32] [INFO ] Invariant cache hit.
[2023-03-10 04:32:32] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 23/23 places, 32/32 transitions.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/23 stabilizing places and 25/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 522 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Finished random walk after 239 steps, including 2 resets, run visited all 4 properties in 3 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 649 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33250 reset in 232 ms.
Product exploration explored 100000 steps with 33217 reset in 525 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-10 04:32:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:32:35] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2023-03-10 04:32:35] [INFO ] Invariant cache hit.
[2023-03-10 04:32:35] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 23/23 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin13237135226794109431
[2023-03-10 04:32:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13237135226794109431
Running compilation step : cd /tmp/ltsmin13237135226794109431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin13237135226794109431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13237135226794109431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1194727152749193964.hoa' '--buchi-type=spotba'
LTSmin run took 3687 ms.
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-07 finished in 9298 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2023-03-10 04:32:39] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18264139705545286260
[2023-03-10 04:32:39] [INFO ] Applying decomposition
[2023-03-10 04:32:39] [INFO ] Computing symmetric may disable matrix : 194 transitions.
[2023-03-10 04:32:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 04:32:39] [INFO ] Computing symmetric may enable matrix : 194 transitions.
[2023-03-10 04:32:39] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 04:32:39] [INFO ] Flatten gal took : 12 ms
[2023-03-10 04:32:39] [INFO ] Computing Do-Not-Accords matrix : 194 transitions.
[2023-03-10 04:32:39] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 04:32:39] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18264139705545286260
Running compilation step : cd /tmp/ltsmin18264139705545286260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5321367263840163294.txt' '-o' '/tmp/graph5321367263840163294.bin' '-w' '/tmp/graph5321367263840163294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5321367263840163294.bin' '-l' '-1' '-v' '-w' '/tmp/graph5321367263840163294.weights' '-q' '0' '-e' '0.001'
[2023-03-10 04:32:39] [INFO ] Decomposing Gal with order
[2023-03-10 04:32:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 04:32:39] [INFO ] Removed a total of 63 redundant transitions.
[2023-03-10 04:32:39] [INFO ] Flatten gal took : 43 ms
[2023-03-10 04:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2023-03-10 04:32:39] [INFO ] Time to serialize gal into /tmp/LTLFireability1524883661125510983.gal : 12 ms
[2023-03-10 04:32:39] [INFO ] Time to serialize properties into /tmp/LTLFireability13855433481130913558.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1524883661125510983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13855433481130913558.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F("(((i19.i0.u55.p217==0)||(u60.p231==0))||(i17.i0.u50.p192==1))"))))||((X("(i14.u40.p146==1)"))U("(i17.i0.u50.p192==1)"))))...156
Formula 0 simplified : F(!"(i17.i0.u50.p192==1)" & X(G!"(((i19.i0.u55.p217==0)||(u60.p231==0))||(i17.i0.u50.p192==1))" & (!"(i17.i0.u50.p192==1)" W !"(i14....171
Compilation finished in 658 ms.
Running link step : cd /tmp/ltsmin18264139705545286260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin18264139705545286260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(X(<>((LTLAPp0==true))))||(X((LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t184, u60.t4, u60.t5, i2.u3.t125, i3.u7.t123, i4.t100, i4.t85, i4.t56, i4.t39, i4.u8.t114, i4...697
Computing Next relation with stutter on 1 deadlock states
164 unique states visited
0 strongly connected components in search stack
213 transitions explored
84 items max in DFS search stack
23135 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,231.387,2221116,1,0,2.99295e+06,275914,1369,1.52887e+07,176,2.04389e+06,565606
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 654778 ms.

BK_STOP 1678423298058

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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-5348"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-08b, 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 r133-smll-167819410700324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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