Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S32C3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716563601142

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 15:13:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 15:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:13:22] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-24 15:13:22] [INFO ] Transformed 5622 places.
[2024-05-24 15:13:23] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:13:23] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 508 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1093 places and 0 transitions.
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 4529 transition count 5449
Discarding 1047 places :
Symmetric choice reduction at 1 with 1047 rule applications. Total rules 2140 place count 3482 transition count 4402
Iterating global reduction 1 with 1047 rules applied. Total rules applied 3187 place count 3482 transition count 4402
Discarding 975 places :
Symmetric choice reduction at 1 with 975 rule applications. Total rules 4162 place count 2507 transition count 3427
Iterating global reduction 1 with 975 rules applied. Total rules applied 5137 place count 2507 transition count 3427
Discarding 970 places :
Symmetric choice reduction at 1 with 970 rule applications. Total rules 6107 place count 1537 transition count 2457
Iterating global reduction 1 with 970 rules applied. Total rules applied 7077 place count 1537 transition count 2457
Discarding 49 places :
Implicit places reduction removed 49 places
Iterating post reduction 1 with 49 rules applied. Total rules applied 7126 place count 1488 transition count 2457
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 7173 place count 1441 transition count 2410
Iterating global reduction 2 with 47 rules applied. Total rules applied 7220 place count 1441 transition count 2410
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 7267 place count 1394 transition count 2363
Iterating global reduction 2 with 47 rules applied. Total rules applied 7314 place count 1394 transition count 2363
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 7361 place count 1347 transition count 2316
Iterating global reduction 2 with 47 rules applied. Total rules applied 7408 place count 1347 transition count 2316
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 7455 place count 1300 transition count 2269
Iterating global reduction 2 with 47 rules applied. Total rules applied 7502 place count 1300 transition count 2269
Discarding 715 places :
Symmetric choice reduction at 2 with 715 rule applications. Total rules 8217 place count 585 transition count 1554
Iterating global reduction 2 with 715 rules applied. Total rules applied 8932 place count 585 transition count 1554
Applied a total of 8932 rules in 1946 ms. Remains 585 /5622 variables (removed 5037) and now considering 1554/5449 (removed 3895) transitions.
[2024-05-24 15:13:25] [INFO ] Flow matrix only has 839 transitions (discarded 715 similar events)
// Phase 1: matrix 839 rows 585 cols
[2024-05-24 15:13:25] [INFO ] Computed 53 invariants in 37 ms
[2024-05-24 15:13:25] [INFO ] Implicit Places using invariants in 514 ms returned [22, 68, 73, 103, 108, 135, 139, 144, 148, 177, 204, 208, 234, 262, 266, 270, 319, 344, 349, 374, 423, 429, 455, 460, 488, 517, 550, 560]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 539 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 557/5622 places, 1554/5449 transitions.
Discarding 221 places :
Symmetric choice reduction at 0 with 221 rule applications. Total rules 221 place count 336 transition count 1333
Iterating global reduction 0 with 221 rules applied. Total rules applied 442 place count 336 transition count 1333
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 444 place count 334 transition count 1331
Iterating global reduction 0 with 2 rules applied. Total rules applied 446 place count 334 transition count 1331
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 448 place count 332 transition count 1329
Iterating global reduction 0 with 2 rules applied. Total rules applied 450 place count 332 transition count 1329
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 452 place count 330 transition count 1327
Iterating global reduction 0 with 2 rules applied. Total rules applied 454 place count 330 transition count 1327
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 463 place count 321 transition count 1318
Iterating global reduction 0 with 9 rules applied. Total rules applied 472 place count 321 transition count 1318
Applied a total of 472 rules in 60 ms. Remains 321 /557 variables (removed 236) and now considering 1318/1554 (removed 236) transitions.
[2024-05-24 15:13:25] [INFO ] Flow matrix only has 552 transitions (discarded 766 similar events)
// Phase 1: matrix 552 rows 321 cols
[2024-05-24 15:13:25] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 15:13:25] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-24 15:13:25] [INFO ] Flow matrix only has 552 transitions (discarded 766 similar events)
[2024-05-24 15:13:25] [INFO ] Invariant cache hit.
[2024-05-24 15:13:26] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 321/5622 places, 1318/5449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3153 ms. Remains : 321/5622 places, 1318/5449 transitions.
Support contains 60 out of 321 places after structural reductions.
[2024-05-24 15:13:26] [INFO ] Flatten gal took : 96 ms
[2024-05-24 15:13:26] [INFO ] Flatten gal took : 61 ms
[2024-05-24 15:13:26] [INFO ] Input system was already deterministic with 1318 transitions.
Support contains 59 out of 321 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10002 steps, including 369 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 35) seen :31
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 15:13:27] [INFO ] Flow matrix only has 552 transitions (discarded 766 similar events)
[2024-05-24 15:13:27] [INFO ] Invariant cache hit.
[2024-05-24 15:13:27] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-24 15:13:27] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 15:13:27] [INFO ] After 258ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-24 15:13:27] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 8 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Graph (complete) has 1106 edges and 321 vertex of which 128 are kept as prefixes of interest. Removing 193 places using SCC suffix rule.5 ms
Discarding 193 places :
Also discarding 105 output transitions
Drop transitions removed 105 transitions
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 124 transition count 1103
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 27 rules applied. Total rules applied 142 place count 119 transition count 1081
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 148 place count 113 transition count 1081
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 148 place count 113 transition count 1077
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 156 place count 109 transition count 1077
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 164 place count 101 transition count 1069
Iterating global reduction 3 with 8 rules applied. Total rules applied 172 place count 101 transition count 1069
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 186 place count 94 transition count 1062
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 94 transition count 1061
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 93 transition count 1061
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 216 place count 93 transition count 1033
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 244 place count 65 transition count 1033
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 261 place count 65 transition count 1033
Applied a total of 261 rules in 145 ms. Remains 65 /321 variables (removed 256) and now considering 1033/1318 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 65/321 places, 1033/1318 transitions.
Incomplete random walk after 10000 steps, including 1588 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:13:28] [INFO ] Flow matrix only has 109 transitions (discarded 924 similar events)
// Phase 1: matrix 109 rows 65 cols
[2024-05-24 15:13:28] [INFO ] Computed 3 invariants in 5 ms
[2024-05-24 15:13:28] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 15:13:28] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 15:13:28] [INFO ] After 37ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 15:13:28] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 1033/1033 transitions.
Graph (complete) has 165 edges and 65 vertex of which 47 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 46 transition count 957
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 128 place count 44 transition count 899
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 154 place count 44 transition count 873
Graph (complete) has 41 edges and 44 vertex of which 31 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 31 transition count 873
Drop transitions removed 364 transitions
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 568 transitions.
Iterating post reduction 3 with 568 rules applied. Total rules applied 723 place count 31 transition count 305
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 724 place count 31 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 725 place count 30 transition count 304
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 727 place count 30 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 729 place count 28 transition count 302
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 745 place count 28 transition count 286
Applied a total of 745 rules in 40 ms. Remains 28 /65 variables (removed 37) and now considering 286/1033 (removed 747) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 28/65 places, 286/1033 transitions.
Incomplete random walk after 10000 steps, including 2033 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2177 steps, run visited all 1 properties in 16 ms. (steps per millisecond=136 )
Probabilistic random walk after 2177 steps, saw 738 distinct states, run finished after 16 ms. (steps per millisecond=136 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 321 stabilizing places and 1318 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 321 transition count 1318
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 299 transition count 1296
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 299 transition count 1296
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 282 transition count 1279
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 282 transition count 1279
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 85 place count 275 transition count 1279
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 105 place count 255 transition count 1259
Iterating global reduction 1 with 20 rules applied. Total rules applied 125 place count 255 transition count 1259
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 249 transition count 1259
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 150 place count 230 transition count 1240
Iterating global reduction 2 with 19 rules applied. Total rules applied 169 place count 230 transition count 1240
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 182 place count 217 transition count 1227
Iterating global reduction 2 with 13 rules applied. Total rules applied 195 place count 217 transition count 1227
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 208 place count 204 transition count 1214
Iterating global reduction 2 with 13 rules applied. Total rules applied 221 place count 204 transition count 1214
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 262 place count 163 transition count 1173
Iterating global reduction 2 with 41 rules applied. Total rules applied 303 place count 163 transition count 1173
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 331 place count 135 transition count 1145
Iterating global reduction 2 with 28 rules applied. Total rules applied 359 place count 135 transition count 1145
Applied a total of 359 rules in 41 ms. Remains 135 /321 variables (removed 186) and now considering 1145/1318 (removed 173) transitions.
[2024-05-24 15:13:28] [INFO ] Flow matrix only has 166 transitions (discarded 979 similar events)
// Phase 1: matrix 166 rows 135 cols
[2024-05-24 15:13:28] [INFO ] Computed 12 invariants in 5 ms
[2024-05-24 15:13:28] [INFO ] Implicit Places using invariants in 129 ms returned [22, 30, 46, 58, 64, 99, 106, 122]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 131 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/321 places, 1145/1318 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 107 transition count 1125
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 107 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 106 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 106 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 105 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 105 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 104 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 104 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 103 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 103 transition count 1121
Applied a total of 48 rules in 18 ms. Remains 103 /127 variables (removed 24) and now considering 1121/1145 (removed 24) transitions.
[2024-05-24 15:13:28] [INFO ] Flow matrix only has 121 transitions (discarded 1000 similar events)
// Phase 1: matrix 121 rows 103 cols
[2024-05-24 15:13:28] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:13:28] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-24 15:13:28] [INFO ] Flow matrix only has 121 transitions (discarded 1000 similar events)
[2024-05-24 15:13:28] [INFO ] Invariant cache hit.
[2024-05-24 15:13:29] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/321 places, 1121/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 455 ms. Remains : 103/321 places, 1121/1318 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 253 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (LT s9 1) (OR (LT s86 1) (LT s91 1))) (LT s84 1) (LT s65 1)), p1:(LT s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3890 reset in 393 ms.
Product exploration explored 100000 steps with 3908 reset in 310 ms.
Computed a total of 103 stabilizing places and 1121 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 103 transition count 1121
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 170 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207496 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207496 steps, saw 52301 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:13:33] [INFO ] Flow matrix only has 121 transitions (discarded 1000 similar events)
[2024-05-24 15:13:33] [INFO ] Invariant cache hit.
[2024-05-24 15:13:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 15:13:33] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 15:13:33] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 15:13:33] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 1121/1121 transitions.
Graph (complete) has 292 edges and 103 vertex of which 70 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 531 transitions
Reduce isomorphic transitions removed 531 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 0 with 532 rules applied. Total rules applied 533 place count 70 transition count 576
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 240 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 254 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 274 rules applied. Total rules applied 807 place count 52 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 809 place count 50 transition count 320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 809 place count 50 transition count 319
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 811 place count 49 transition count 319
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 3 with 4 rules applied. Total rules applied 815 place count 47 transition count 317
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 828 place count 47 transition count 304
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 831 place count 47 transition count 301
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 834 place count 44 transition count 301
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 850 place count 44 transition count 285
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 866 place count 44 transition count 269
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 882 place count 28 transition count 269
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 896 place count 28 transition count 269
Applied a total of 896 rules in 26 ms. Remains 28 /103 variables (removed 75) and now considering 269/1121 (removed 852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 28/103 places, 269/1121 transitions.
Incomplete random walk after 10000 steps, including 2036 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9404 steps, run visited all 1 properties in 17 ms. (steps per millisecond=553 )
Probabilistic random walk after 9404 steps, saw 2557 distinct states, run finished after 17 ms. (steps per millisecond=553 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 10 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-00 finished in 5327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 295 transition count 1292
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 295 transition count 1292
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 71 place count 276 transition count 1273
Iterating global reduction 0 with 19 rules applied. Total rules applied 90 place count 276 transition count 1273
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 97 place count 269 transition count 1273
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 118 place count 248 transition count 1252
Iterating global reduction 1 with 21 rules applied. Total rules applied 139 place count 248 transition count 1252
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 147 place count 240 transition count 1252
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 169 place count 218 transition count 1230
Iterating global reduction 2 with 22 rules applied. Total rules applied 191 place count 218 transition count 1230
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 206 place count 203 transition count 1215
Iterating global reduction 2 with 15 rules applied. Total rules applied 221 place count 203 transition count 1215
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 236 place count 188 transition count 1200
Iterating global reduction 2 with 15 rules applied. Total rules applied 251 place count 188 transition count 1200
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 294 place count 145 transition count 1157
Iterating global reduction 2 with 43 rules applied. Total rules applied 337 place count 145 transition count 1157
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 375 place count 107 transition count 1119
Iterating global reduction 2 with 38 rules applied. Total rules applied 413 place count 107 transition count 1119
Applied a total of 413 rules in 41 ms. Remains 107 /321 variables (removed 214) and now considering 1119/1318 (removed 199) transitions.
[2024-05-24 15:13:34] [INFO ] Flow matrix only has 106 transitions (discarded 1013 similar events)
// Phase 1: matrix 106 rows 107 cols
[2024-05-24 15:13:34] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 15:13:34] [INFO ] Implicit Places using invariants in 105 ms returned [20, 28, 44, 56, 62, 84, 90, 96]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 107 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/321 places, 1119/1318 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 1104
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 1104
Applied a total of 30 rules in 6 ms. Remains 84 /99 variables (removed 15) and now considering 1104/1119 (removed 15) transitions.
[2024-05-24 15:13:34] [INFO ] Flow matrix only has 84 transitions (discarded 1020 similar events)
// Phase 1: matrix 84 rows 84 cols
[2024-05-24 15:13:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 15:13:34] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-24 15:13:34] [INFO ] Flow matrix only has 84 transitions (discarded 1020 similar events)
[2024-05-24 15:13:34] [INFO ] Invariant cache hit.
[2024-05-24 15:13:34] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/321 places, 1104/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 84/321 places, 1104/1318 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-01 finished in 507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&F(G(!p1))))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 297 transition count 1294
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 297 transition count 1294
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 280 transition count 1277
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 280 transition count 1277
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 88 place count 274 transition count 1277
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 106 place count 256 transition count 1259
Iterating global reduction 1 with 18 rules applied. Total rules applied 124 place count 256 transition count 1259
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 131 place count 249 transition count 1259
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 150 place count 230 transition count 1240
Iterating global reduction 2 with 19 rules applied. Total rules applied 169 place count 230 transition count 1240
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 182 place count 217 transition count 1227
Iterating global reduction 2 with 13 rules applied. Total rules applied 195 place count 217 transition count 1227
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 208 place count 204 transition count 1214
Iterating global reduction 2 with 13 rules applied. Total rules applied 221 place count 204 transition count 1214
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 258 place count 167 transition count 1177
Iterating global reduction 2 with 37 rules applied. Total rules applied 295 place count 167 transition count 1177
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 328 place count 134 transition count 1144
Iterating global reduction 2 with 33 rules applied. Total rules applied 361 place count 134 transition count 1144
Applied a total of 361 rules in 38 ms. Remains 134 /321 variables (removed 187) and now considering 1144/1318 (removed 174) transitions.
[2024-05-24 15:13:34] [INFO ] Flow matrix only has 163 transitions (discarded 981 similar events)
// Phase 1: matrix 163 rows 134 cols
[2024-05-24 15:13:34] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 15:13:34] [INFO ] Implicit Places using invariants in 116 ms returned [20, 28, 44, 56, 62, 109, 115, 121]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 117 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/321 places, 1144/1318 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 103 transition count 1121
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 103 transition count 1121
Applied a total of 46 rules in 6 ms. Remains 103 /126 variables (removed 23) and now considering 1121/1144 (removed 23) transitions.
[2024-05-24 15:13:34] [INFO ] Flow matrix only has 133 transitions (discarded 988 similar events)
// Phase 1: matrix 133 rows 103 cols
[2024-05-24 15:13:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:13:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 15:13:34] [INFO ] Flow matrix only has 133 transitions (discarded 988 similar events)
[2024-05-24 15:13:34] [INFO ] Invariant cache hit.
[2024-05-24 15:13:34] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/321 places, 1121/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 411 ms. Remains : 103/321 places, 1121/1318 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s78 1), p1:(AND (GEQ s56 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3884 reset in 280 ms.
Product exploration explored 100000 steps with 3884 reset in 249 ms.
Computed a total of 103 stabilizing places and 1121 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 103 transition count 1121
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-02 finished in 1292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X((p1||F(p2)))))||G(F(!p0)))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Graph (complete) has 2214 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 320 transition count 1289
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 292 transition count 1289
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 57 place count 292 transition count 1272
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 91 place count 275 transition count 1272
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 107 place count 259 transition count 1256
Iterating global reduction 2 with 16 rules applied. Total rules applied 123 place count 259 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 254 transition count 1251
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 254 transition count 1251
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 138 place count 249 transition count 1251
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 138 place count 249 transition count 1246
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 148 place count 244 transition count 1246
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 153 place count 239 transition count 1241
Iterating global reduction 3 with 5 rules applied. Total rules applied 158 place count 239 transition count 1241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 163 place count 234 transition count 1236
Iterating global reduction 3 with 5 rules applied. Total rules applied 168 place count 234 transition count 1236
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 193 place count 209 transition count 1211
Iterating global reduction 3 with 25 rules applied. Total rules applied 218 place count 209 transition count 1211
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 284 place count 176 transition count 1178
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 291 place count 169 transition count 1171
Iterating global reduction 3 with 7 rules applied. Total rules applied 298 place count 169 transition count 1171
Applied a total of 298 rules in 120 ms. Remains 169 /321 variables (removed 152) and now considering 1171/1318 (removed 147) transitions.
[2024-05-24 15:13:35] [INFO ] Flow matrix only has 316 transitions (discarded 855 similar events)
// Phase 1: matrix 316 rows 169 cols
[2024-05-24 15:13:35] [INFO ] Computed 20 invariants in 3 ms
[2024-05-24 15:13:36] [INFO ] Implicit Places using invariants in 135 ms returned [12, 20, 23, 34, 48, 60, 65, 78, 83, 96, 100, 125, 133, 139, 145, 151]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 137 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/321 places, 1171/1318 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 106 transition count 1124
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 106 transition count 1124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 100 transition count 1118
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 100 transition count 1118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 94 transition count 1112
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 94 transition count 1112
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 134 place count 86 transition count 1104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 84 transition count 1102
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 84 transition count 1102
Applied a total of 138 rules in 34 ms. Remains 84 /153 variables (removed 69) and now considering 1102/1171 (removed 69) transitions.
[2024-05-24 15:13:36] [INFO ] Flow matrix only has 112 transitions (discarded 990 similar events)
// Phase 1: matrix 112 rows 84 cols
[2024-05-24 15:13:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:13:36] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 15:13:36] [INFO ] Flow matrix only has 112 transitions (discarded 990 similar events)
[2024-05-24 15:13:36] [INFO ] Invariant cache hit.
[2024-05-24 15:13:36] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/321 places, 1102/1318 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 541 ms. Remains : 84/321 places, 1102/1318 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s47 1)), p1:(LT s40 1), p2:(OR (LT s58 1) (LT s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7718 reset in 247 ms.
Product exploration explored 100000 steps with 7692 reset in 298 ms.
Computed a total of 84 stabilizing places and 1102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 1102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-03 finished in 1319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(!p0))) U (p1 U X(!p0)))))'
Support contains 2 out of 321 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 : 321/321 places, 1318/1318 transitions.
Graph (complete) has 2214 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 320 transition count 1288
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 291 transition count 1288
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 59 place count 291 transition count 1272
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 91 place count 275 transition count 1272
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 107 place count 259 transition count 1256
Iterating global reduction 2 with 16 rules applied. Total rules applied 123 place count 259 transition count 1256
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 129 place count 253 transition count 1250
Iterating global reduction 2 with 6 rules applied. Total rules applied 135 place count 253 transition count 1250
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 247 transition count 1250
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 141 place count 247 transition count 1244
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 153 place count 241 transition count 1244
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 159 place count 235 transition count 1238
Iterating global reduction 3 with 6 rules applied. Total rules applied 165 place count 235 transition count 1238
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 171 place count 229 transition count 1232
Iterating global reduction 3 with 6 rules applied. Total rules applied 177 place count 229 transition count 1232
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 207 place count 199 transition count 1202
Iterating global reduction 3 with 30 rules applied. Total rules applied 237 place count 199 transition count 1202
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 299 place count 168 transition count 1171
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 307 place count 160 transition count 1163
Iterating global reduction 3 with 8 rules applied. Total rules applied 315 place count 160 transition count 1163
Applied a total of 315 rules in 75 ms. Remains 160 /321 variables (removed 161) and now considering 1163/1318 (removed 155) transitions.
[2024-05-24 15:13:37] [INFO ] Flow matrix only has 292 transitions (discarded 871 similar events)
// Phase 1: matrix 292 rows 160 cols
[2024-05-24 15:13:37] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 15:13:37] [INFO ] Implicit Places using invariants in 131 ms returned [12, 20, 23, 34, 48, 60, 65, 70, 76, 97, 101, 117, 125, 131, 137]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 134 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/321 places, 1163/1318 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 145 transition count 1162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 144 transition count 1162
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 39 place count 107 transition count 1125
Iterating global reduction 0 with 37 rules applied. Total rules applied 76 place count 107 transition count 1125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 101 transition count 1119
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 101 transition count 1119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 93 transition count 1111
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 93 transition count 1111
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 86 transition count 1104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 84 transition count 1102
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 84 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 83 transition count 1101
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 83 transition count 1101
Applied a total of 124 rules in 38 ms. Remains 83 /145 variables (removed 62) and now considering 1101/1163 (removed 62) transitions.
[2024-05-24 15:13:37] [INFO ] Flow matrix only has 96 transitions (discarded 1005 similar events)
// Phase 1: matrix 96 rows 83 cols
[2024-05-24 15:13:37] [INFO ] Computed 4 invariants in 3 ms
[2024-05-24 15:13:37] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 15:13:37] [INFO ] Flow matrix only has 96 transitions (discarded 1005 similar events)
[2024-05-24 15:13:37] [INFO ] Invariant cache hit.
[2024-05-24 15:13:37] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/321 places, 1101/1318 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 507 ms. Remains : 83/321 places, 1101/1318 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s46 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33264 reset in 323 ms.
Product exploration explored 100000 steps with 33258 reset in 296 ms.
Computed a total of 83 stabilizing places and 1101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 83 transition count 1101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-04 finished in 1361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(X(G((!p1&&F(!p2)))))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 297 transition count 1294
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 297 transition count 1294
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 280 transition count 1277
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 280 transition count 1277
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 88 place count 274 transition count 1277
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 107 place count 255 transition count 1258
Iterating global reduction 1 with 19 rules applied. Total rules applied 126 place count 255 transition count 1258
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 133 place count 248 transition count 1258
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 153 place count 228 transition count 1238
Iterating global reduction 2 with 20 rules applied. Total rules applied 173 place count 228 transition count 1238
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 186 place count 215 transition count 1225
Iterating global reduction 2 with 13 rules applied. Total rules applied 199 place count 215 transition count 1225
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 212 place count 202 transition count 1212
Iterating global reduction 2 with 13 rules applied. Total rules applied 225 place count 202 transition count 1212
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 262 place count 165 transition count 1175
Iterating global reduction 2 with 37 rules applied. Total rules applied 299 place count 165 transition count 1175
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 332 place count 132 transition count 1142
Iterating global reduction 2 with 33 rules applied. Total rules applied 365 place count 132 transition count 1142
Applied a total of 365 rules in 36 ms. Remains 132 /321 variables (removed 189) and now considering 1142/1318 (removed 176) transitions.
[2024-05-24 15:13:38] [INFO ] Flow matrix only has 161 transitions (discarded 981 similar events)
// Phase 1: matrix 161 rows 132 cols
[2024-05-24 15:13:38] [INFO ] Computed 12 invariants in 2 ms
[2024-05-24 15:13:38] [INFO ] Implicit Places using invariants in 122 ms returned [20, 28, 44, 56, 62, 83, 95, 113, 119]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 124 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/321 places, 1142/1318 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 99 transition count 1118
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 99 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 98 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 98 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 97 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 97 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 96 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 96 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 95 transition count 1114
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 95 transition count 1114
Applied a total of 56 rules in 17 ms. Remains 95 /123 variables (removed 28) and now considering 1114/1142 (removed 28) transitions.
[2024-05-24 15:13:38] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
// Phase 1: matrix 111 rows 95 cols
[2024-05-24 15:13:38] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 15:13:38] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-24 15:13:38] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
[2024-05-24 15:13:38] [INFO ] Invariant cache hit.
[2024-05-24 15:13:38] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/321 places, 1114/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 425 ms. Remains : 95/321 places, 1114/1318 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2 p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s65 1), p1:(AND (GEQ s72 1) (GEQ s77 1)), p2:(AND (GEQ s38 1) (GEQ s69 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]]
Product exploration explored 100000 steps with 4244 reset in 204 ms.
Product exploration explored 100000 steps with 4191 reset in 218 ms.
Computed a total of 95 stabilizing places and 1114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 95 transition count 1114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-05 finished in 1331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Graph (complete) has 2214 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 320 transition count 1287
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 290 transition count 1287
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 61 place count 290 transition count 1270
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 273 transition count 1270
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 111 place count 257 transition count 1254
Iterating global reduction 2 with 16 rules applied. Total rules applied 127 place count 257 transition count 1254
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 133 place count 251 transition count 1248
Iterating global reduction 2 with 6 rules applied. Total rules applied 139 place count 251 transition count 1248
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 145 place count 245 transition count 1248
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 145 place count 245 transition count 1242
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 157 place count 239 transition count 1242
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 163 place count 233 transition count 1236
Iterating global reduction 3 with 6 rules applied. Total rules applied 169 place count 233 transition count 1236
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 227 transition count 1230
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 227 transition count 1230
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 211 place count 197 transition count 1200
Iterating global reduction 3 with 30 rules applied. Total rules applied 241 place count 197 transition count 1200
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 303 place count 166 transition count 1169
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 311 place count 158 transition count 1161
Iterating global reduction 3 with 8 rules applied. Total rules applied 319 place count 158 transition count 1161
Applied a total of 319 rules in 67 ms. Remains 158 /321 variables (removed 163) and now considering 1161/1318 (removed 157) transitions.
[2024-05-24 15:13:39] [INFO ] Flow matrix only has 291 transitions (discarded 870 similar events)
// Phase 1: matrix 291 rows 158 cols
[2024-05-24 15:13:39] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 15:13:39] [INFO ] Implicit Places using invariants in 137 ms returned [12, 20, 23, 34, 48, 60, 71, 77, 82, 95, 99, 115, 123, 129, 135, 141]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 139 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/321 places, 1161/1318 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 103 transition count 1122
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 103 transition count 1122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 96 transition count 1115
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 96 transition count 1115
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 87 transition count 1106
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 87 transition count 1106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 122 place count 81 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 79 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 79 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 77 transition count 1096
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 77 transition count 1096
Applied a total of 130 rules in 30 ms. Remains 77 /142 variables (removed 65) and now considering 1096/1161 (removed 65) transitions.
[2024-05-24 15:13:40] [INFO ] Flow matrix only has 76 transitions (discarded 1020 similar events)
// Phase 1: matrix 76 rows 77 cols
[2024-05-24 15:13:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 15:13:40] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 15:13:40] [INFO ] Flow matrix only has 76 transitions (discarded 1020 similar events)
[2024-05-24 15:13:40] [INFO ] Invariant cache hit.
[2024-05-24 15:13:40] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/321 places, 1096/1318 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 475 ms. Remains : 77/321 places, 1096/1318 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s36 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9041 reset in 239 ms.
Product exploration explored 100000 steps with 9035 reset in 255 ms.
Computed a total of 77 stabilizing places and 1096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 1096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-06 finished in 1157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Graph (complete) has 2214 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 320 transition count 1287
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 290 transition count 1287
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 61 place count 290 transition count 1270
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 273 transition count 1270
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 111 place count 257 transition count 1254
Iterating global reduction 2 with 16 rules applied. Total rules applied 127 place count 257 transition count 1254
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 133 place count 251 transition count 1248
Iterating global reduction 2 with 6 rules applied. Total rules applied 139 place count 251 transition count 1248
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 145 place count 245 transition count 1248
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 145 place count 245 transition count 1242
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 157 place count 239 transition count 1242
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 163 place count 233 transition count 1236
Iterating global reduction 3 with 6 rules applied. Total rules applied 169 place count 233 transition count 1236
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 227 transition count 1230
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 227 transition count 1230
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 211 place count 197 transition count 1200
Iterating global reduction 3 with 30 rules applied. Total rules applied 241 place count 197 transition count 1200
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 303 place count 166 transition count 1169
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 311 place count 158 transition count 1161
Iterating global reduction 3 with 8 rules applied. Total rules applied 319 place count 158 transition count 1161
Applied a total of 319 rules in 62 ms. Remains 158 /321 variables (removed 163) and now considering 1161/1318 (removed 157) transitions.
[2024-05-24 15:13:40] [INFO ] Flow matrix only has 291 transitions (discarded 870 similar events)
// Phase 1: matrix 291 rows 158 cols
[2024-05-24 15:13:40] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 15:13:41] [INFO ] Implicit Places using invariants in 150 ms returned [21, 24, 35, 49, 61, 66, 71, 77, 82, 95, 99, 115, 123, 129, 135, 141]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 151 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/321 places, 1161/1318 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 103 transition count 1122
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 103 transition count 1122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 96 transition count 1115
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 96 transition count 1115
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 103 place count 85 transition count 1104
Iterating global reduction 0 with 11 rules applied. Total rules applied 114 place count 85 transition count 1104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 126 place count 79 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 77 transition count 1096
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 77 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 76 transition count 1095
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 76 transition count 1095
Applied a total of 132 rules in 29 ms. Remains 76 /142 variables (removed 66) and now considering 1095/1161 (removed 66) transitions.
[2024-05-24 15:13:41] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
// Phase 1: matrix 74 rows 76 cols
[2024-05-24 15:13:41] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:13:41] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 15:13:41] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
[2024-05-24 15:13:41] [INFO ] Invariant cache hit.
[2024-05-24 15:13:41] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/321 places, 1095/1318 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 480 ms. Remains : 76/321 places, 1095/1318 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9036 reset in 236 ms.
Product exploration explored 100000 steps with 9033 reset in 251 ms.
Computed a total of 76 stabilizing places and 1095 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 1095
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-07 finished in 1169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(p1)))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 296 transition count 1293
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 296 transition count 1293
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 68 place count 278 transition count 1275
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 278 transition count 1275
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 272 transition count 1275
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 111 place count 253 transition count 1256
Iterating global reduction 1 with 19 rules applied. Total rules applied 130 place count 253 transition count 1256
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 245 transition count 1256
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 159 place count 224 transition count 1235
Iterating global reduction 2 with 21 rules applied. Total rules applied 180 place count 224 transition count 1235
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 194 place count 210 transition count 1221
Iterating global reduction 2 with 14 rules applied. Total rules applied 208 place count 210 transition count 1221
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 222 place count 196 transition count 1207
Iterating global reduction 2 with 14 rules applied. Total rules applied 236 place count 196 transition count 1207
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 274 place count 158 transition count 1169
Iterating global reduction 2 with 38 rules applied. Total rules applied 312 place count 158 transition count 1169
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 350 place count 120 transition count 1131
Iterating global reduction 2 with 38 rules applied. Total rules applied 388 place count 120 transition count 1131
Applied a total of 388 rules in 31 ms. Remains 120 /321 variables (removed 201) and now considering 1131/1318 (removed 187) transitions.
[2024-05-24 15:13:42] [INFO ] Flow matrix only has 134 transitions (discarded 997 similar events)
// Phase 1: matrix 134 rows 120 cols
[2024-05-24 15:13:42] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 15:13:42] [INFO ] Implicit Places using invariants in 110 ms returned [20, 28, 44, 68, 74, 96, 102, 108]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 111 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/321 places, 1131/1318 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 93 transition count 1112
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 93 transition count 1112
Applied a total of 38 rules in 5 ms. Remains 93 /112 variables (removed 19) and now considering 1112/1131 (removed 19) transitions.
[2024-05-24 15:13:42] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
// Phase 1: matrix 108 rows 93 cols
[2024-05-24 15:13:42] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 15:13:42] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-24 15:13:42] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
[2024-05-24 15:13:42] [INFO ] Invariant cache hit.
[2024-05-24 15:13:42] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/321 places, 1112/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 383 ms. Remains : 93/321 places, 1112/1318 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 2}]], initial=4, aps=[p0:(OR (LT s70 1) (LT s83 1)), p1:(OR (LT s41 1) (LT s43 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3217 steps with 124 reset in 12 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-08 finished in 649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (G(!p0)||(!p0&&G((p1||X(F(p2)))))))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Graph (complete) has 2214 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 320 transition count 1290
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 293 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 292 transition count 1289
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 57 place count 292 transition count 1272
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 91 place count 275 transition count 1272
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 108 place count 258 transition count 1255
Iterating global reduction 3 with 17 rules applied. Total rules applied 125 place count 258 transition count 1255
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 131 place count 252 transition count 1249
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 252 transition count 1249
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 3 with 6 rules applied. Total rules applied 143 place count 246 transition count 1249
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 143 place count 246 transition count 1243
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 155 place count 240 transition count 1243
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 161 place count 234 transition count 1237
Iterating global reduction 4 with 6 rules applied. Total rules applied 167 place count 234 transition count 1237
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 173 place count 228 transition count 1231
Iterating global reduction 4 with 6 rules applied. Total rules applied 179 place count 228 transition count 1231
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 208 place count 199 transition count 1202
Iterating global reduction 4 with 29 rules applied. Total rules applied 237 place count 199 transition count 1202
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 299 place count 168 transition count 1171
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 305 place count 162 transition count 1165
Iterating global reduction 4 with 6 rules applied. Total rules applied 311 place count 162 transition count 1165
Applied a total of 311 rules in 63 ms. Remains 162 /321 variables (removed 159) and now considering 1165/1318 (removed 153) transitions.
[2024-05-24 15:13:42] [INFO ] Flow matrix only has 295 transitions (discarded 870 similar events)
// Phase 1: matrix 295 rows 162 cols
[2024-05-24 15:13:42] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 15:13:42] [INFO ] Implicit Places using invariants in 138 ms returned [12, 52, 64, 69, 74, 80, 85, 98, 102, 119, 127, 133, 139, 145]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 139 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/321 places, 1165/1318 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 112 transition count 1129
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 112 transition count 1129
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 107 transition count 1124
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 107 transition count 1124
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 99 transition count 1116
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 99 transition count 1116
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 114 place count 91 transition count 1108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 89 transition count 1106
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 89 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 88 transition count 1105
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 88 transition count 1105
Applied a total of 120 rules in 28 ms. Remains 88 /148 variables (removed 60) and now considering 1105/1165 (removed 60) transitions.
[2024-05-24 15:13:42] [INFO ] Flow matrix only has 117 transitions (discarded 988 similar events)
// Phase 1: matrix 117 rows 88 cols
[2024-05-24 15:13:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 15:13:43] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 15:13:43] [INFO ] Flow matrix only has 117 transitions (discarded 988 similar events)
[2024-05-24 15:13:43] [INFO ] Invariant cache hit.
[2024-05-24 15:13:43] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/321 places, 1105/1318 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 492 ms. Remains : 88/321 places, 1105/1318 transitions.
Stuttering acceptance computed with spot in 174 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s64 1)), p1:(GEQ s17 1), p2:(LT s26 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33361 reset in 318 ms.
Product exploration explored 100000 steps with 33457 reset in 334 ms.
Computed a total of 88 stabilizing places and 1105 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 1105
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 15 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-09 finished in 1477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 296 transition count 1293
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 296 transition count 1293
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 68 place count 278 transition count 1275
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 278 transition count 1275
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 93 place count 271 transition count 1275
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 113 place count 251 transition count 1255
Iterating global reduction 1 with 20 rules applied. Total rules applied 133 place count 251 transition count 1255
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 140 place count 244 transition count 1255
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 161 place count 223 transition count 1234
Iterating global reduction 2 with 21 rules applied. Total rules applied 182 place count 223 transition count 1234
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 196 place count 209 transition count 1220
Iterating global reduction 2 with 14 rules applied. Total rules applied 210 place count 209 transition count 1220
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 224 place count 195 transition count 1206
Iterating global reduction 2 with 14 rules applied. Total rules applied 238 place count 195 transition count 1206
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 280 place count 153 transition count 1164
Iterating global reduction 2 with 42 rules applied. Total rules applied 322 place count 153 transition count 1164
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 355 place count 120 transition count 1131
Iterating global reduction 2 with 33 rules applied. Total rules applied 388 place count 120 transition count 1131
Applied a total of 388 rules in 36 ms. Remains 120 /321 variables (removed 201) and now considering 1131/1318 (removed 187) transitions.
[2024-05-24 15:13:44] [INFO ] Flow matrix only has 134 transitions (discarded 997 similar events)
// Phase 1: matrix 134 rows 120 cols
[2024-05-24 15:13:44] [INFO ] Computed 11 invariants in 0 ms
[2024-05-24 15:13:44] [INFO ] Implicit Places using invariants in 112 ms returned [20, 28, 44, 56, 62, 96, 102, 108]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 113 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/321 places, 1131/1318 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 94 transition count 1113
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 94 transition count 1113
Applied a total of 36 rules in 5 ms. Remains 94 /112 variables (removed 18) and now considering 1113/1131 (removed 18) transitions.
[2024-05-24 15:13:44] [INFO ] Flow matrix only has 109 transitions (discarded 1004 similar events)
// Phase 1: matrix 109 rows 94 cols
[2024-05-24 15:13:44] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 15:13:44] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-24 15:13:44] [INFO ] Flow matrix only has 109 transitions (discarded 1004 similar events)
[2024-05-24 15:13:44] [INFO ] Invariant cache hit.
[2024-05-24 15:13:44] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 94/321 places, 1113/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 399 ms. Remains : 94/321 places, 1113/1318 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s48 1) (LT s68 1)), p0:(LT s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 46574 reset in 280 ms.
Product exploration explored 100000 steps with 46627 reset in 301 ms.
Computed a total of 94 stabilizing places and 1113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 1113
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-10 finished in 1245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p1||X(p2))&&p0))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 296 transition count 1293
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 296 transition count 1293
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 69 place count 277 transition count 1274
Iterating global reduction 0 with 19 rules applied. Total rules applied 88 place count 277 transition count 1274
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 95 place count 270 transition count 1274
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 116 place count 249 transition count 1253
Iterating global reduction 1 with 21 rules applied. Total rules applied 137 place count 249 transition count 1253
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 145 place count 241 transition count 1253
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 167 place count 219 transition count 1231
Iterating global reduction 2 with 22 rules applied. Total rules applied 189 place count 219 transition count 1231
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 204 place count 204 transition count 1216
Iterating global reduction 2 with 15 rules applied. Total rules applied 219 place count 204 transition count 1216
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 234 place count 189 transition count 1201
Iterating global reduction 2 with 15 rules applied. Total rules applied 249 place count 189 transition count 1201
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 292 place count 146 transition count 1158
Iterating global reduction 2 with 43 rules applied. Total rules applied 335 place count 146 transition count 1158
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 373 place count 108 transition count 1120
Iterating global reduction 2 with 38 rules applied. Total rules applied 411 place count 108 transition count 1120
Applied a total of 411 rules in 35 ms. Remains 108 /321 variables (removed 213) and now considering 1120/1318 (removed 198) transitions.
[2024-05-24 15:13:45] [INFO ] Flow matrix only has 108 transitions (discarded 1012 similar events)
// Phase 1: matrix 108 rows 108 cols
[2024-05-24 15:13:45] [INFO ] Computed 10 invariants in 5 ms
[2024-05-24 15:13:45] [INFO ] Implicit Places using invariants in 114 ms returned [20, 28, 44, 56, 84, 90, 96]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 115 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/321 places, 1120/1318 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 88 transition count 1107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 88 transition count 1107
Applied a total of 26 rules in 6 ms. Remains 88 /101 variables (removed 13) and now considering 1107/1120 (removed 13) transitions.
[2024-05-24 15:13:45] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
// Phase 1: matrix 89 rows 88 cols
[2024-05-24 15:13:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:13:45] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 15:13:45] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
[2024-05-24 15:13:45] [INFO ] Invariant cache hit.
[2024-05-24 15:13:45] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/321 places, 1107/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 380 ms. Remains : 88/321 places, 1107/1318 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-11 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=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s42 1) (GEQ s69 1)), p1:(AND (GEQ s48 1) (GEQ s79 1) (GEQ s1 1) (GEQ s43 1)), p2:(OR (LT s1 1) (LT s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-11 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||(!p2 U (p3||G(!p2)))))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Graph (complete) has 2214 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 320 transition count 1290
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 293 transition count 1290
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 55 place count 293 transition count 1274
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 87 place count 277 transition count 1274
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 262 transition count 1259
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 262 transition count 1259
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 257 transition count 1254
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 257 transition count 1254
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 132 place count 252 transition count 1254
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 132 place count 252 transition count 1249
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 142 place count 247 transition count 1249
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 147 place count 242 transition count 1244
Iterating global reduction 3 with 5 rules applied. Total rules applied 152 place count 242 transition count 1244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 157 place count 237 transition count 1239
Iterating global reduction 3 with 5 rules applied. Total rules applied 162 place count 237 transition count 1239
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 182 place count 217 transition count 1219
Iterating global reduction 3 with 20 rules applied. Total rules applied 202 place count 217 transition count 1219
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 270 place count 183 transition count 1185
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 282 place count 171 transition count 1173
Iterating global reduction 3 with 12 rules applied. Total rules applied 294 place count 171 transition count 1173
Applied a total of 294 rules in 70 ms. Remains 171 /321 variables (removed 150) and now considering 1173/1318 (removed 145) transitions.
[2024-05-24 15:13:46] [INFO ] Flow matrix only has 319 transitions (discarded 854 similar events)
// Phase 1: matrix 319 rows 171 cols
[2024-05-24 15:13:46] [INFO ] Computed 20 invariants in 4 ms
[2024-05-24 15:13:46] [INFO ] Implicit Places using invariants in 138 ms returned [12, 20, 23, 34, 48, 69, 74, 81, 87, 92, 105, 109, 125, 133, 147, 153]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 140 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/321 places, 1173/1318 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 108 transition count 1126
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 108 transition count 1126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 102 transition count 1120
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 102 transition count 1120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 96 transition count 1114
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 96 transition count 1114
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 134 place count 88 transition count 1106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 86 transition count 1104
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 86 transition count 1104
Applied a total of 138 rules in 28 ms. Remains 86 /155 variables (removed 69) and now considering 1104/1173 (removed 69) transitions.
[2024-05-24 15:13:46] [INFO ] Flow matrix only has 115 transitions (discarded 989 similar events)
// Phase 1: matrix 115 rows 86 cols
[2024-05-24 15:13:46] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 15:13:46] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-24 15:13:46] [INFO ] Flow matrix only has 115 transitions (discarded 989 similar events)
[2024-05-24 15:13:46] [INFO ] Invariant cache hit.
[2024-05-24 15:13:46] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/321 places, 1104/1318 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 481 ms. Remains : 86/321 places, 1104/1318 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR p1 p3 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(AND p1 (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(LT s44 1), p1:(LT s71 1), p3:(AND (NOT (AND (GEQ s6 1) (GEQ s15 1))) (NOT (AND (GEQ s34 1) (GEQ s36 1)))), p2:(AND (GEQ s34 1) (GEQ s36 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 7646 reset in 256 ms.
Product exploration explored 100000 steps with 7676 reset in 270 ms.
Computed a total of 86 stabilizing places and 1104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 1104
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (OR p1 p3 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (OR p1 p3 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (F (G p0)), (F (G p1)), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND p1 (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (X (AND p1 (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 16 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-13 finished in 1383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X((p1 U (!p2 U p3)))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 298 transition count 1295
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 298 transition count 1295
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 63 place count 281 transition count 1278
Iterating global reduction 0 with 17 rules applied. Total rules applied 80 place count 281 transition count 1278
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 275 transition count 1278
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 104 place count 257 transition count 1260
Iterating global reduction 1 with 18 rules applied. Total rules applied 122 place count 257 transition count 1260
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 129 place count 250 transition count 1260
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 148 place count 231 transition count 1241
Iterating global reduction 2 with 19 rules applied. Total rules applied 167 place count 231 transition count 1241
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 180 place count 218 transition count 1228
Iterating global reduction 2 with 13 rules applied. Total rules applied 193 place count 218 transition count 1228
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 206 place count 205 transition count 1215
Iterating global reduction 2 with 13 rules applied. Total rules applied 219 place count 205 transition count 1215
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 256 place count 168 transition count 1178
Iterating global reduction 2 with 37 rules applied. Total rules applied 293 place count 168 transition count 1178
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 327 place count 134 transition count 1144
Iterating global reduction 2 with 34 rules applied. Total rules applied 361 place count 134 transition count 1144
Applied a total of 361 rules in 39 ms. Remains 134 /321 variables (removed 187) and now considering 1144/1318 (removed 174) transitions.
[2024-05-24 15:13:47] [INFO ] Flow matrix only has 163 transitions (discarded 981 similar events)
// Phase 1: matrix 163 rows 134 cols
[2024-05-24 15:13:47] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 15:13:47] [INFO ] Implicit Places using invariants in 110 ms returned [20, 28, 44, 80, 86, 115, 121]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 112 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/321 places, 1144/1318 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 107 transition count 1124
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 107 transition count 1124
Applied a total of 40 rules in 6 ms. Remains 107 /127 variables (removed 20) and now considering 1124/1144 (removed 20) transitions.
[2024-05-24 15:13:47] [INFO ] Flow matrix only has 137 transitions (discarded 987 similar events)
// Phase 1: matrix 137 rows 107 cols
[2024-05-24 15:13:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 15:13:47] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-24 15:13:47] [INFO ] Flow matrix only has 137 transitions (discarded 987 similar events)
[2024-05-24 15:13:47] [INFO ] Invariant cache hit.
[2024-05-24 15:13:47] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/321 places, 1124/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 423 ms. Remains : 107/321 places, 1124/1318 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s80 1) (GEQ s86 1)) (AND (GEQ s40 1) (GEQ s42 1))), p3:(AND (GEQ s40 1) (GEQ s42 1) (GEQ s57 1)), p1:(GEQ s57 1), p2:(AND (GEQ s40 1) (GE...], 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, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-14 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(!G(X(F(G(F(!p0)))))) U !p1)))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1318/1318 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 296 transition count 1293
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 296 transition count 1293
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 69 place count 277 transition count 1274
Iterating global reduction 0 with 19 rules applied. Total rules applied 88 place count 277 transition count 1274
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 95 place count 270 transition count 1274
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 116 place count 249 transition count 1253
Iterating global reduction 1 with 21 rules applied. Total rules applied 137 place count 249 transition count 1253
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 145 place count 241 transition count 1253
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 167 place count 219 transition count 1231
Iterating global reduction 2 with 22 rules applied. Total rules applied 189 place count 219 transition count 1231
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 204 place count 204 transition count 1216
Iterating global reduction 2 with 15 rules applied. Total rules applied 219 place count 204 transition count 1216
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 234 place count 189 transition count 1201
Iterating global reduction 2 with 15 rules applied. Total rules applied 249 place count 189 transition count 1201
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 292 place count 146 transition count 1158
Iterating global reduction 2 with 43 rules applied. Total rules applied 335 place count 146 transition count 1158
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 373 place count 108 transition count 1120
Iterating global reduction 2 with 38 rules applied. Total rules applied 411 place count 108 transition count 1120
Applied a total of 411 rules in 37 ms. Remains 108 /321 variables (removed 213) and now considering 1120/1318 (removed 198) transitions.
[2024-05-24 15:13:48] [INFO ] Flow matrix only has 108 transitions (discarded 1012 similar events)
// Phase 1: matrix 108 rows 108 cols
[2024-05-24 15:13:48] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 15:13:48] [INFO ] Implicit Places using invariants in 103 ms returned [20, 28, 57, 63, 85, 91, 97]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 104 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/321 places, 1120/1318 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 88 transition count 1107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 88 transition count 1107
Applied a total of 26 rules in 7 ms. Remains 88 /101 variables (removed 13) and now considering 1107/1120 (removed 13) transitions.
[2024-05-24 15:13:48] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
// Phase 1: matrix 89 rows 88 cols
[2024-05-24 15:13:48] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:13:48] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 15:13:48] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
[2024-05-24 15:13:48] [INFO ] Invariant cache hit.
[2024-05-24 15:13:48] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/321 places, 1107/1318 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 364 ms. Remains : 88/321 places, 1107/1318 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s47 1) (GEQ s76 1)), p0:(AND (GEQ s29 1) (GEQ s35 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 LeafsetExtension-PT-S32C3-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-15 finished in 588 ms.
All properties solved by simple procedures.
Total runtime 26280 ms.

BK_STOP 1716563630563

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S32C3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is LeafsetExtension-PT-S32C3, 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 r241-tall-171649628400233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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