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.r597-smll-171734926500113.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 MedleyA-PT-23, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 150K Jun 2 16:33 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 MedleyA-PT-23-LTLFireability-00
FORMULA_NAME MedleyA-PT-23-LTLFireability-01
FORMULA_NAME MedleyA-PT-23-LTLFireability-02
FORMULA_NAME MedleyA-PT-23-LTLFireability-03
FORMULA_NAME MedleyA-PT-23-LTLFireability-04
FORMULA_NAME MedleyA-PT-23-LTLFireability-05
FORMULA_NAME MedleyA-PT-23-LTLFireability-06
FORMULA_NAME MedleyA-PT-23-LTLFireability-07
FORMULA_NAME MedleyA-PT-23-LTLFireability-08
FORMULA_NAME MedleyA-PT-23-LTLFireability-09
FORMULA_NAME MedleyA-PT-23-LTLFireability-10
FORMULA_NAME MedleyA-PT-23-LTLFireability-11
FORMULA_NAME MedleyA-PT-23-LTLFireability-12
FORMULA_NAME MedleyA-PT-23-LTLFireability-13
FORMULA_NAME MedleyA-PT-23-LTLFireability-14
FORMULA_NAME MedleyA-PT-23-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368012594

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=MedleyA-PT-23
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:40:15] [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-06-02 22:40:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:40:15] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-06-02 22:40:15] [INFO ] Transformed 378 places.
[2024-06-02 22:40:15] [INFO ] Transformed 614 transitions.
[2024-06-02 22:40:15] [INFO ] Found NUPN structural information;
[2024-06-02 22:40:15] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyA-PT-23-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 96 place count 282 transition count 521
Iterating global reduction 1 with 93 rules applied. Total rules applied 189 place count 282 transition count 521
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 256 place count 215 transition count 454
Iterating global reduction 1 with 67 rules applied. Total rules applied 323 place count 215 transition count 454
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 346 place count 192 transition count 413
Iterating global reduction 1 with 23 rules applied. Total rules applied 369 place count 192 transition count 413
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 377 place count 184 transition count 390
Iterating global reduction 1 with 8 rules applied. Total rules applied 385 place count 184 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 386 place count 184 transition count 389
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 182 transition count 384
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 182 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 392 place count 182 transition count 382
Applied a total of 392 rules in 137 ms. Remains 182 /378 variables (removed 196) and now considering 382/614 (removed 232) transitions.
// Phase 1: matrix 382 rows 182 cols
[2024-06-02 22:40:16] [INFO ] Computed 8 invariants in 28 ms
[2024-06-02 22:40:16] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-06-02 22:40:16] [INFO ] Invariant cache hit.
[2024-06-02 22:40:17] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2024-06-02 22:40:17] [INFO ] Invariant cache hit.
[2024-06-02 22:40:17] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 182/378 places, 382/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1561 ms. Remains : 182/378 places, 382/614 transitions.
Support contains 39 out of 182 places after structural reductions.
[2024-06-02 22:40:17] [INFO ] Flatten gal took : 95 ms
[2024-06-02 22:40:17] [INFO ] Flatten gal took : 41 ms
[2024-06-02 22:40:17] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 38 out of 182 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 851 ms. (steps per millisecond=11 ) properties (out of 26) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-06-02 22:40:18] [INFO ] Invariant cache hit.
[2024-06-02 22:40:19] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 22:40:19] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-06-02 22:40:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:40:20] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-06-02 22:40:20] [INFO ] After 964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 357 ms.
[2024-06-02 22:40:20] [INFO ] After 1586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 12 properties in 108 ms.
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 150 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 5 ms
Free SCC test removed 17 places
Drop transitions removed 31 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 165 transition count 336
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 154 transition count 336
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 23 place count 154 transition count 327
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 41 place count 145 transition count 327
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 61 place count 125 transition count 289
Iterating global reduction 2 with 20 rules applied. Total rules applied 81 place count 125 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 125 transition count 286
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 125 transition count 284
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 123 transition count 284
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 93 place count 118 transition count 270
Iterating global reduction 3 with 5 rules applied. Total rules applied 98 place count 118 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 102 place count 118 transition count 266
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 117 transition count 265
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 116 transition count 262
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 116 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 116 transition count 261
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 153 place count 93 transition count 238
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 159 place count 93 transition count 232
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 164 place count 88 transition count 217
Iterating global reduction 7 with 5 rules applied. Total rules applied 169 place count 88 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 170 place count 88 transition count 216
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 171 place count 87 transition count 214
Iterating global reduction 8 with 1 rules applied. Total rules applied 172 place count 87 transition count 214
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 173 place count 86 transition count 211
Iterating global reduction 8 with 1 rules applied. Total rules applied 174 place count 86 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 175 place count 86 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 177 place count 85 transition count 209
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 195 place count 76 transition count 224
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 205 place count 76 transition count 214
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 207 place count 74 transition count 208
Iterating global reduction 9 with 2 rules applied. Total rules applied 209 place count 74 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 211 place count 74 transition count 206
Free-agglomeration rule applied 21 times.
Iterating global reduction 10 with 21 rules applied. Total rules applied 232 place count 74 transition count 185
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 259 place count 53 transition count 179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 265 place count 50 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 266 place count 49 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 267 place count 48 transition count 175
Applied a total of 267 rules in 166 ms. Remains 48 /182 variables (removed 134) and now considering 175/382 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 48/182 places, 175/382 transitions.
Finished random walk after 141 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 18 stabilizing places and 23 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 141 edges and 182 vertex of which 13 / 182 are part of one of the 2 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 170 transition count 349
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 157 transition count 348
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 28 place count 157 transition count 339
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 148 transition count 339
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 68 place count 126 transition count 299
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 126 transition count 299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 126 transition count 296
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 93 place count 126 transition count 294
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 118 transition count 278
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 118 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 118 transition count 275
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 116 transition count 270
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 116 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 116 transition count 269
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 167 place count 91 transition count 244
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 91 transition count 239
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 179 place count 84 transition count 218
Iterating global reduction 6 with 7 rules applied. Total rules applied 186 place count 84 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 188 place count 84 transition count 216
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 189 place count 83 transition count 214
Iterating global reduction 7 with 1 rules applied. Total rules applied 190 place count 83 transition count 214
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 191 place count 82 transition count 211
Iterating global reduction 7 with 1 rules applied. Total rules applied 192 place count 82 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 193 place count 82 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 195 place count 81 transition count 209
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 213 place count 72 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 215 place count 72 transition count 223
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 221 place count 72 transition count 217
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 223 place count 70 transition count 211
Iterating global reduction 9 with 2 rules applied. Total rules applied 225 place count 70 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 227 place count 70 transition count 209
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 229 place count 68 transition count 207
Applied a total of 229 rules in 109 ms. Remains 68 /182 variables (removed 114) and now considering 207/382 (removed 175) transitions.
[2024-06-02 22:40:21] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
// Phase 1: matrix 198 rows 68 cols
[2024-06-02 22:40:21] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:40:21] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 22:40:21] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2024-06-02 22:40:21] [INFO ] Invariant cache hit.
[2024-06-02 22:40:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:40:21] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-06-02 22:40:21] [INFO ] Redundant transitions in 12 ms returned []
[2024-06-02 22:40:22] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2024-06-02 22:40:22] [INFO ] Invariant cache hit.
[2024-06-02 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/182 places, 207/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 576 ms. Remains : 68/182 places, 207/382 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 208 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-23-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-00 finished in 863 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&&X(p1)))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 354
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 354
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 157 transition count 336
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 157 transition count 336
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 157 transition count 333
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 152 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 152 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 152 transition count 320
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 150 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 150 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 313
Applied a total of 71 rules in 16 ms. Remains 150 /182 variables (removed 32) and now considering 313/382 (removed 69) transitions.
// Phase 1: matrix 313 rows 150 cols
[2024-06-02 22:40:22] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:40:22] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:40:22] [INFO ] Invariant cache hit.
[2024-06-02 22:40:22] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-02 22:40:22] [INFO ] Invariant cache hit.
[2024-06-02 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 313/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 150/182 places, 313/382 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s38 1), p1:(OR (EQ s7 0) (EQ s22 0) (EQ s30 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-01 finished in 788 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(((p1 U p2)&&p0))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 143 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 164 transition count 340
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 152 transition count 339
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 26 place count 152 transition count 331
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 144 transition count 331
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 63 place count 123 transition count 290
Iterating global reduction 2 with 21 rules applied. Total rules applied 84 place count 123 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 87 place count 123 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 123 transition count 286
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 122 transition count 286
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 118 transition count 275
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 118 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 118 transition count 273
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 117 transition count 270
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 117 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 117 transition count 269
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 144 place count 96 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 148 place count 96 transition count 244
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 153 place count 91 transition count 229
Iterating global reduction 6 with 5 rules applied. Total rules applied 158 place count 91 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 159 place count 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 160 place count 90 transition count 226
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 162 place count 89 transition count 223
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 89 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 164 place count 89 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 166 place count 88 transition count 221
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 182 place count 80 transition count 233
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 191 place count 80 transition count 224
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 194 place count 77 transition count 215
Iterating global reduction 8 with 3 rules applied. Total rules applied 197 place count 77 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 200 place count 77 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 202 place count 75 transition count 210
Applied a total of 202 rules in 96 ms. Remains 75 /182 variables (removed 107) and now considering 210/382 (removed 172) transitions.
[2024-06-02 22:40:23] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
// Phase 1: matrix 201 rows 75 cols
[2024-06-02 22:40:23] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:40:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:40:23] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2024-06-02 22:40:23] [INFO ] Invariant cache hit.
[2024-06-02 22:40:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:40:23] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-06-02 22:40:23] [INFO ] Redundant transitions in 12 ms returned []
[2024-06-02 22:40:23] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2024-06-02 22:40:23] [INFO ] Invariant cache hit.
[2024-06-02 22:40:23] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/182 places, 210/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 75/182 places, 210/382 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s42 1), p0:(AND (EQ s12 1) (EQ s52 1) (EQ s74 1)), p1:(AND (EQ s2 1) (EQ s8 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-05 finished in 635 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(p1))||p0)))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 353
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 352
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 155 transition count 332
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 155 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 59 place count 155 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 317
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 148 transition count 310
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 148 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 148 transition count 308
Applied a total of 77 rules in 12 ms. Remains 148 /182 variables (removed 34) and now considering 308/382 (removed 74) transitions.
// Phase 1: matrix 308 rows 148 cols
[2024-06-02 22:40:23] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:40:23] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 22:40:23] [INFO ] Invariant cache hit.
[2024-06-02 22:40:24] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-06-02 22:40:24] [INFO ] Invariant cache hit.
[2024-06-02 22:40:24] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/182 places, 308/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 148/182 places, 308/382 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-06 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s38 0) (EQ s123 0)), p1:(EQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-23-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLFireability-06 finished in 1480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1&&F((F(p2)&&X(p1))))))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 351
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 350
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 155 transition count 330
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 155 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 59 place count 155 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 315
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 313
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 148 transition count 308
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 148 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 148 transition count 306
Applied a total of 77 rules in 13 ms. Remains 148 /182 variables (removed 34) and now considering 306/382 (removed 76) transitions.
// Phase 1: matrix 306 rows 148 cols
[2024-06-02 22:40:25] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:40:25] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:40:25] [INFO ] Invariant cache hit.
[2024-06-02 22:40:25] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 22:40:25] [INFO ] Invariant cache hit.
[2024-06-02 22:40:25] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/182 places, 306/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 583 ms. Remains : 148/182 places, 306/382 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s125 0), p1:(OR (EQ s53 0) (EQ s137 0)), p2:(EQ s112 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-23-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLFireability-07 finished in 1347 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))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 152 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 164 transition count 339
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 151 transition count 338
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 28 place count 151 transition count 330
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 44 place count 143 transition count 330
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 66 place count 121 transition count 288
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 121 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 121 transition count 285
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 91 place count 121 transition count 283
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 95 place count 119 transition count 283
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 114 transition count 269
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 114 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 114 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 113 transition count 263
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 113 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 113 transition count 262
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 155 place count 91 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 159 place count 91 transition count 236
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 164 place count 86 transition count 221
Iterating global reduction 6 with 5 rules applied. Total rules applied 169 place count 86 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 86 transition count 220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 85 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 85 transition count 218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 173 place count 84 transition count 215
Iterating global reduction 7 with 1 rules applied. Total rules applied 174 place count 84 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 175 place count 84 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 177 place count 83 transition count 213
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 195 place count 74 transition count 228
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 204 place count 74 transition count 219
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 207 place count 71 transition count 210
Iterating global reduction 8 with 3 rules applied. Total rules applied 210 place count 71 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 213 place count 71 transition count 207
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 215 place count 69 transition count 205
Applied a total of 215 rules in 62 ms. Remains 69 /182 variables (removed 113) and now considering 205/382 (removed 177) transitions.
[2024-06-02 22:40:26] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
// Phase 1: matrix 195 rows 69 cols
[2024-06-02 22:40:26] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:40:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:40:26] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2024-06-02 22:40:26] [INFO ] Invariant cache hit.
[2024-06-02 22:40:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:40:26] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-06-02 22:40:26] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:40:26] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2024-06-02 22:40:26] [INFO ] Invariant cache hit.
[2024-06-02 22:40:27] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/182 places, 205/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 69/182 places, 205/382 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-08 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||G(p1)) U (p2||(X(F(p1))&&F(p3)))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 351
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 350
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 157 transition count 334
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 157 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 157 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 153 transition count 321
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 153 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 153 transition count 319
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 152 transition count 317
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 152 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 152 transition count 316
Applied a total of 68 rules in 8 ms. Remains 152 /182 variables (removed 30) and now considering 316/382 (removed 66) transitions.
// Phase 1: matrix 316 rows 152 cols
[2024-06-02 22:40:27] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:40:27] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 22:40:27] [INFO ] Invariant cache hit.
[2024-06-02 22:40:27] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-02 22:40:27] [INFO ] Invariant cache hit.
[2024-06-02 22:40:27] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 316/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 620 ms. Remains : 152/182 places, 316/382 transitions.
Stuttering acceptance computed with spot in 412 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s7 1) (EQ s18 1) (EQ s75 1)), p3:(EQ s110 1), p1:(AND (EQ s86 1) (EQ s131 1)), p0:(EQ s54 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, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-09 finished in 1061 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(p1)&&F(G(p2)))))'
Support contains 6 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 147 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 164 transition count 339
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 151 transition count 338
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 28 place count 151 transition count 332
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 145 transition count 332
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 61 place count 124 transition count 293
Iterating global reduction 2 with 21 rules applied. Total rules applied 82 place count 124 transition count 293
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 124 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 124 transition count 289
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 87 place count 123 transition count 289
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 117 transition count 272
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 117 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 117 transition count 268
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 116 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 116 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 116 transition count 264
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 152 place count 93 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 156 place count 93 transition count 237
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 161 place count 88 transition count 222
Iterating global reduction 6 with 5 rules applied. Total rules applied 166 place count 88 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 167 place count 88 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 169 place count 87 transition count 220
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 187 place count 78 transition count 235
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 196 place count 78 transition count 226
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 198 place count 76 transition count 220
Iterating global reduction 7 with 2 rules applied. Total rules applied 200 place count 76 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 202 place count 76 transition count 218
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 204 place count 74 transition count 216
Applied a total of 204 rules in 54 ms. Remains 74 /182 variables (removed 108) and now considering 216/382 (removed 166) transitions.
[2024-06-02 22:40:28] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
// Phase 1: matrix 207 rows 74 cols
[2024-06-02 22:40:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:40:28] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 22:40:28] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
[2024-06-02 22:40:28] [INFO ] Invariant cache hit.
[2024-06-02 22:40:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:40:28] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-02 22:40:28] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:40:28] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
[2024-06-02 22:40:28] [INFO ] Invariant cache hit.
[2024-06-02 22:40:28] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/182 places, 216/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 74/182 places, 216/382 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s9 1), p1:(AND (EQ s11 1) (EQ s14 1)), p2:(AND (EQ s2 1) (EQ s12 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-11 finished in 685 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((F(p0)||(X(p2)&&p1)))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 167 transition count 357
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 167 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 167 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 159 transition count 340
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 159 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 159 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 155 transition count 329
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 155 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 155 transition count 328
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 153 transition count 323
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 153 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 153 transition count 321
Applied a total of 65 rules in 13 ms. Remains 153 /182 variables (removed 29) and now considering 321/382 (removed 61) transitions.
// Phase 1: matrix 321 rows 153 cols
[2024-06-02 22:40:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:40:29] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 22:40:29] [INFO ] Invariant cache hit.
[2024-06-02 22:40:29] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-06-02 22:40:29] [INFO ] Invariant cache hit.
[2024-06-02 22:40:29] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 321/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 153/182 places, 321/382 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(NEQ s20 1), p1:(AND (OR (NEQ s8 1) (NEQ s23 1) (NEQ s108 1)) (OR (NEQ s8 1) (NEQ s15 1) (NEQ s89 1))), p2:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 35 reset in 232 ms.
Product exploration explored 100000 steps with 1 reset in 270 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Detected a total of 17/153 stabilizing places and 22/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 283 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:40:31] [INFO ] Invariant cache hit.
[2024-06-02 22:40:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 22:40:31] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 22:40:31] [INFO ] After 163ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-06-02 22:40:31] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 321/321 transitions.
Graph (trivial) has 116 edges and 153 vertex of which 16 / 153 are part of one of the 3 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 23 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 26 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 0 with 6 rules applied. Total rules applied 7 place count 140 transition count 289
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 134 transition count 289
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 13 place count 134 transition count 282
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 127 transition count 282
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 120 transition count 269
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 120 transition count 269
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 91 place count 95 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 95 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 89 transition count 222
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 89 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 110 place count 89 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 88 transition count 218
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 130 place count 79 transition count 233
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 139 place count 79 transition count 224
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 142 place count 76 transition count 215
Iterating global reduction 4 with 3 rules applied. Total rules applied 145 place count 76 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 76 transition count 212
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 167 place count 76 transition count 193
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 186 place count 57 transition count 193
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 189 place count 57 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 56 transition count 189
Applied a total of 190 rules in 40 ms. Remains 56 /153 variables (removed 97) and now considering 189/321 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 56/153 places, 189/321 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 163 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=163 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 623 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 321/321 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2024-06-02 22:40:32] [INFO ] Invariant cache hit.
[2024-06-02 22:40:32] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 22:40:32] [INFO ] Invariant cache hit.
[2024-06-02 22:40:32] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-06-02 22:40:32] [INFO ] Invariant cache hit.
[2024-06-02 22:40:33] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 632 ms. Remains : 153/153 places, 321/321 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Detected a total of 17/153 stabilizing places and 22/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 279 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:40:33] [INFO ] Invariant cache hit.
[2024-06-02 22:40:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 22:40:33] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 22:40:33] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-06-02 22:40:34] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 321/321 transitions.
Graph (trivial) has 116 edges and 153 vertex of which 16 / 153 are part of one of the 3 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 23 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 26 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 0 with 6 rules applied. Total rules applied 7 place count 140 transition count 289
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 134 transition count 289
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 13 place count 134 transition count 282
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 127 transition count 282
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 120 transition count 269
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 120 transition count 269
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 91 place count 95 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 95 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 89 transition count 222
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 89 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 110 place count 89 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 88 transition count 218
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 130 place count 79 transition count 233
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 139 place count 79 transition count 224
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 142 place count 76 transition count 215
Iterating global reduction 4 with 3 rules applied. Total rules applied 145 place count 76 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 76 transition count 212
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 167 place count 76 transition count 193
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 186 place count 57 transition count 193
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 189 place count 57 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 56 transition count 189
Applied a total of 190 rules in 37 ms. Remains 56 /153 variables (removed 97) and now considering 189/321 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 56/153 places, 189/321 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 467 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=467 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 710 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 5 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 321/321 transitions.
Graph (trivial) has 115 edges and 153 vertex of which 16 / 153 are part of one of the 3 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 140 transition count 301
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 140 transition count 304
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 140 transition count 304
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 19 place count 131 transition count 289
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 131 transition count 289
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 131 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 131 transition count 288
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 67 place count 118 transition count 263
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 80 place count 118 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 118 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 118 transition count 260
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 117 transition count 259
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 117 transition count 259
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 117 transition count 301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 101 place count 117 transition count 298
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 114 transition count 292
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 114 transition count 292
Deduced a syphon composed of 33 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 114 transition count 280
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 125 place count 108 transition count 268
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 131 place count 108 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 108 transition count 265
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 134 rules in 42 ms. Remains 108 /153 variables (removed 45) and now considering 265/321 (removed 56) transitions.
[2024-06-02 22:40:36] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:40:36] [INFO ] Flow matrix only has 256 transitions (discarded 9 similar events)
// Phase 1: matrix 256 rows 108 cols
[2024-06-02 22:40:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:40:36] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/153 places, 265/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 108/153 places, 265/321 transitions.
Built C files in :
/tmp/ltsmin13324905828380915425
[2024-06-02 22:40:36] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13324905828380915425
Running compilation step : cd /tmp/ltsmin13324905828380915425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1082 ms.
Running link step : cd /tmp/ltsmin13324905828380915425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin13324905828380915425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17239080079085862724.hoa' '--buchi-type=spotba'
LTSmin run took 2316 ms.
FORMULA MedleyA-PT-23-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-23-LTLFireability-12 finished in 11005 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||G((p1&&F(G(p2)))))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 152 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 164 transition count 340
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 152 transition count 339
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 26 place count 152 transition count 330
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 143 transition count 330
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 65 place count 122 transition count 291
Iterating global reduction 2 with 21 rules applied. Total rules applied 86 place count 122 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 122 transition count 288
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 89 place count 122 transition count 286
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 115 transition count 272
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 115 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 115 transition count 269
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 114 transition count 266
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 114 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 114 transition count 265
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 153 place count 92 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 157 place count 92 transition count 239
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 162 place count 87 transition count 224
Iterating global reduction 6 with 5 rules applied. Total rules applied 167 place count 87 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 168 place count 87 transition count 223
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 86 transition count 221
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 86 transition count 221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 85 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 85 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 173 place count 85 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 175 place count 84 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 193 place count 75 transition count 231
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 202 place count 75 transition count 222
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 205 place count 72 transition count 213
Iterating global reduction 8 with 3 rules applied. Total rules applied 208 place count 72 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 211 place count 72 transition count 210
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 213 place count 70 transition count 208
Applied a total of 213 rules in 56 ms. Remains 70 /182 variables (removed 112) and now considering 208/382 (removed 174) transitions.
[2024-06-02 22:40:40] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
// Phase 1: matrix 198 rows 70 cols
[2024-06-02 22:40:40] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:40:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:40:40] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:40:40] [INFO ] Invariant cache hit.
[2024-06-02 22:40:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:40:40] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-02 22:40:40] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:40:40] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:40:40] [INFO ] Invariant cache hit.
[2024-06-02 22:40:40] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/182 places, 208/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 70/182 places, 208/382 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s22 0) (EQ s62 0)), p0:(AND (EQ s22 1) (EQ s62 1)), p2:(EQ s10 0)], 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 5 reset in 240 ms.
Product exploration explored 100000 steps with 1 reset in 190 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (AND (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 162 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-06-02 22:40:41] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:40:41] [INFO ] Invariant cache hit.
[2024-06-02 22:40:41] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:40:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:40:41] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (AND (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 439 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 70 /70 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-06-02 22:40:42] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:40:42] [INFO ] Invariant cache hit.
[2024-06-02 22:40:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 22:40:42] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:40:42] [INFO ] Invariant cache hit.
[2024-06-02 22:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:40:42] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-02 22:40:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:40:42] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:40:42] [INFO ] Invariant cache hit.
[2024-06-02 22:40:42] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 439 ms. Remains : 70/70 places, 208/208 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Finished Best-First random walk after 250 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering criterion allowed to conclude after 221 steps with 19 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-13 finished in 3565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p0||F(G(p1)))))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 354
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 166 transition count 353
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 158 transition count 338
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 158 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 158 transition count 335
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 153 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 153 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 153 transition count 322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 151 transition count 317
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 151 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 151 transition count 315
Applied a total of 70 rules in 10 ms. Remains 151 /182 variables (removed 31) and now considering 315/382 (removed 67) transitions.
// Phase 1: matrix 315 rows 151 cols
[2024-06-02 22:40:43] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:40:43] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 22:40:43] [INFO ] Invariant cache hit.
[2024-06-02 22:40:43] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-02 22:40:43] [INFO ] Invariant cache hit.
[2024-06-02 22:40:44] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/182 places, 315/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 151/182 places, 315/382 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s22 1) (EQ s31 1)), p1:(AND (EQ s7 1) (EQ s22 1) (EQ s58 1) (EQ s79 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-14 finished in 913 ms.
All properties solved by simple procedures.
Total runtime 29128 ms.

BK_STOP 1717368045599

--------------------
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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r597-smll-171734926500113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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