fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856418900452
Last Updated
May 14, 2023

About the Execution of LTSMin+red for LeafsetExtension-PT-S08C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
436.063 12082.00 22926.00 368.70 FFFTFFTTFFFFFTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 647K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679527665011

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 23:27:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 23:27:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:27:46] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-22 23:27:46] [INFO ] Transformed 462 places.
[2023-03-22 23:27:46] [INFO ] Transformed 409 transitions.
[2023-03-22 23:27:46] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 377 transition count 409
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 148 place count 314 transition count 346
Iterating global reduction 1 with 63 rules applied. Total rules applied 211 place count 314 transition count 346
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 248 place count 277 transition count 309
Iterating global reduction 1 with 37 rules applied. Total rules applied 285 place count 277 transition count 309
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 322 place count 240 transition count 272
Iterating global reduction 1 with 37 rules applied. Total rules applied 359 place count 240 transition count 272
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 366 place count 233 transition count 272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 371 place count 228 transition count 267
Iterating global reduction 2 with 5 rules applied. Total rules applied 376 place count 228 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 380 place count 224 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 384 place count 224 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 388 place count 220 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 392 place count 220 transition count 259
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 396 place count 216 transition count 255
Iterating global reduction 2 with 4 rules applied. Total rules applied 400 place count 216 transition count 255
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 407 place count 209 transition count 248
Iterating global reduction 2 with 7 rules applied. Total rules applied 414 place count 209 transition count 248
Applied a total of 414 rules in 106 ms. Remains 209 /462 variables (removed 253) and now considering 248/409 (removed 161) transitions.
[2023-03-22 23:27:47] [INFO ] Flow matrix only has 241 transitions (discarded 7 similar events)
// Phase 1: matrix 241 rows 209 cols
[2023-03-22 23:27:47] [INFO ] Computed 23 place invariants in 26 ms
[2023-03-22 23:27:47] [INFO ] Implicit Places using invariants in 297 ms returned [32, 49, 75, 90, 92, 116]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 322 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 203/462 places, 248/409 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 187 transition count 232
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 187 transition count 232
Applied a total of 32 rules in 7 ms. Remains 187 /203 variables (removed 16) and now considering 232/248 (removed 16) transitions.
[2023-03-22 23:27:47] [INFO ] Flow matrix only has 223 transitions (discarded 9 similar events)
// Phase 1: matrix 223 rows 187 cols
[2023-03-22 23:27:47] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-22 23:27:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-22 23:27:47] [INFO ] Flow matrix only has 223 transitions (discarded 9 similar events)
[2023-03-22 23:27:47] [INFO ] Invariant cache hit.
[2023-03-22 23:27:47] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 187/462 places, 232/409 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 713 ms. Remains : 187/462 places, 232/409 transitions.
Support contains 51 out of 187 places after structural reductions.
[2023-03-22 23:27:47] [INFO ] Flatten gal took : 42 ms
[2023-03-22 23:27:47] [INFO ] Flatten gal took : 17 ms
[2023-03-22 23:27:48] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 49 out of 187 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 32) seen :30
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Finished Best-First random walk after 280 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=140 )
Computed a total of 187 stabilizing places and 232 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 187 transition count 232
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 168 transition count 213
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 168 transition count 213
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 152 transition count 197
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 152 transition count 197
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 149 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 91 place count 131 transition count 179
Iterating global reduction 1 with 18 rules applied. Total rules applied 109 place count 131 transition count 179
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 116 place count 124 transition count 179
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 129 place count 111 transition count 166
Iterating global reduction 2 with 13 rules applied. Total rules applied 142 place count 111 transition count 166
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 101 transition count 156
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 101 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 91 transition count 146
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 91 transition count 146
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 81 transition count 136
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 81 transition count 136
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 221 place count 62 transition count 117
Iterating global reduction 2 with 19 rules applied. Total rules applied 240 place count 62 transition count 117
Applied a total of 240 rules in 22 ms. Remains 62 /187 variables (removed 125) and now considering 117/232 (removed 115) transitions.
[2023-03-22 23:27:48] [INFO ] Flow matrix only has 68 transitions (discarded 49 similar events)
// Phase 1: matrix 68 rows 62 cols
[2023-03-22 23:27:48] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-22 23:27:48] [INFO ] Implicit Places using invariants in 50 ms returned [27, 40, 48, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/187 places, 117/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 49 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 49 transition count 108
Applied a total of 18 rules in 3 ms. Remains 49 /58 variables (removed 9) and now considering 108/117 (removed 9) transitions.
[2023-03-22 23:27:48] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
// Phase 1: matrix 56 rows 49 cols
[2023-03-22 23:27:48] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 23:27:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 23:27:48] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
[2023-03-22 23:27:48] [INFO ] Invariant cache hit.
[2023-03-22 23:27:48] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/187 places, 108/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 49/187 places, 108/232 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s43 1) (OR (LT s29 1) (LT s31 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 52 steps with 2 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-00 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 212
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 150 transition count 195
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 150 transition count 195
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 146 transition count 195
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 97 place count 127 transition count 176
Iterating global reduction 1 with 19 rules applied. Total rules applied 116 place count 127 transition count 176
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 122 place count 121 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 135 place count 108 transition count 163
Iterating global reduction 2 with 13 rules applied. Total rules applied 148 place count 108 transition count 163
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 158 place count 98 transition count 153
Iterating global reduction 2 with 10 rules applied. Total rules applied 168 place count 98 transition count 153
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 178 place count 88 transition count 143
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 88 transition count 143
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 201 place count 75 transition count 130
Iterating global reduction 2 with 13 rules applied. Total rules applied 214 place count 75 transition count 130
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 232 place count 57 transition count 112
Iterating global reduction 2 with 18 rules applied. Total rules applied 250 place count 57 transition count 112
Applied a total of 250 rules in 18 ms. Remains 57 /187 variables (removed 130) and now considering 112/232 (removed 120) transitions.
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 59 transitions (discarded 53 similar events)
// Phase 1: matrix 59 rows 57 cols
[2023-03-22 23:27:49] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants in 40 ms returned [27, 31, 35, 48]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/187 places, 112/232 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 46 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 46 transition count 105
Applied a total of 14 rules in 2 ms. Remains 46 /53 variables (removed 7) and now considering 105/112 (removed 7) transitions.
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2023-03-22 23:27:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
[2023-03-22 23:27:49] [INFO ] Invariant cache hit.
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/187 places, 105/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 46/187 places, 105/232 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-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: 2}]], initial=1, aps=[p0:(AND (GEQ s34 1) (GEQ s19 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-01 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((X(G(p0))&&X(p1)) U p2)))))'
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 212
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 150 transition count 195
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 150 transition count 195
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 146 transition count 195
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 128 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 128 transition count 177
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 122 transition count 177
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 133 place count 109 transition count 164
Iterating global reduction 2 with 13 rules applied. Total rules applied 146 place count 109 transition count 164
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 156 place count 99 transition count 154
Iterating global reduction 2 with 10 rules applied. Total rules applied 166 place count 99 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 176 place count 89 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 89 transition count 144
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 199 place count 76 transition count 131
Iterating global reduction 2 with 13 rules applied. Total rules applied 212 place count 76 transition count 131
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 230 place count 58 transition count 113
Iterating global reduction 2 with 18 rules applied. Total rules applied 248 place count 58 transition count 113
Applied a total of 248 rules in 23 ms. Remains 58 /187 variables (removed 129) and now considering 113/232 (removed 119) transitions.
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 60 transitions (discarded 53 similar events)
// Phase 1: matrix 60 rows 58 cols
[2023-03-22 23:27:49] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants in 43 ms returned [27, 41, 45, 49]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/187 places, 113/232 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 106
Applied a total of 14 rules in 1 ms. Remains 47 /54 variables (removed 7) and now considering 106/113 (removed 7) transitions.
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 50 transitions (discarded 56 similar events)
// Phase 1: matrix 50 rows 47 cols
[2023-03-22 23:27:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 50 transitions (discarded 56 similar events)
[2023-03-22 23:27:49] [INFO ] Invariant cache hit.
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 47/187 places, 106/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 47/187 places, 106/232 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s14 1) (GEQ s15 1)), p1:(AND (GEQ s31 1) (GEQ s33 1)), p0:(GEQ s28 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-02 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(F(p1)))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 212
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 149 transition count 194
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 149 transition count 194
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 145 transition count 194
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 100 place count 125 transition count 174
Iterating global reduction 1 with 20 rules applied. Total rules applied 120 place count 125 transition count 174
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 127 place count 118 transition count 174
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 141 place count 104 transition count 160
Iterating global reduction 2 with 14 rules applied. Total rules applied 155 place count 104 transition count 160
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 165 place count 94 transition count 150
Iterating global reduction 2 with 10 rules applied. Total rules applied 175 place count 94 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 185 place count 84 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 195 place count 84 transition count 140
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 208 place count 71 transition count 127
Iterating global reduction 2 with 13 rules applied. Total rules applied 221 place count 71 transition count 127
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 240 place count 52 transition count 108
Iterating global reduction 2 with 19 rules applied. Total rules applied 259 place count 52 transition count 108
Applied a total of 259 rules in 30 ms. Remains 52 /187 variables (removed 135) and now considering 108/232 (removed 124) transitions.
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
// Phase 1: matrix 56 rows 52 cols
[2023-03-22 23:27:49] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants in 50 ms returned [31, 35, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/187 places, 108/232 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 44 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 44 transition count 103
Applied a total of 10 rules in 2 ms. Remains 44 /49 variables (removed 5) and now considering 103/108 (removed 5) transitions.
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 49 transitions (discarded 54 similar events)
// Phase 1: matrix 49 rows 44 cols
[2023-03-22 23:27:49] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 23:27:49] [INFO ] Flow matrix only has 49 transitions (discarded 54 similar events)
[2023-03-22 23:27:49] [INFO ] Invariant cache hit.
[2023-03-22 23:27:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 44/187 places, 103/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 44/187 places, 103/232 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s38 1), p1:(OR (LT s22 1) (LT s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33029 reset in 232 ms.
Product exploration explored 100000 steps with 32985 reset in 190 ms.
Computed a total of 44 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-03 finished in 904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (X((X(p2)&&F(!p3)))&&p1))))'
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 168 transition count 213
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 168 transition count 213
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 151 transition count 196
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 151 transition count 196
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 147 transition count 196
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 95 place count 128 transition count 177
Iterating global reduction 1 with 19 rules applied. Total rules applied 114 place count 128 transition count 177
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 122 transition count 177
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 134 place count 108 transition count 163
Iterating global reduction 2 with 14 rules applied. Total rules applied 148 place count 108 transition count 163
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 158 place count 98 transition count 153
Iterating global reduction 2 with 10 rules applied. Total rules applied 168 place count 98 transition count 153
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 178 place count 88 transition count 143
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 88 transition count 143
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 201 place count 75 transition count 130
Iterating global reduction 2 with 13 rules applied. Total rules applied 214 place count 75 transition count 130
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 232 place count 57 transition count 112
Iterating global reduction 2 with 18 rules applied. Total rules applied 250 place count 57 transition count 112
Applied a total of 250 rules in 11 ms. Remains 57 /187 variables (removed 130) and now considering 112/232 (removed 120) transitions.
[2023-03-22 23:27:50] [INFO ] Flow matrix only has 60 transitions (discarded 52 similar events)
// Phase 1: matrix 60 rows 57 cols
[2023-03-22 23:27:50] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-22 23:27:50] [INFO ] Implicit Places using invariants in 39 ms returned [28, 32, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/187 places, 112/232 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 107
Applied a total of 10 rules in 1 ms. Remains 49 /54 variables (removed 5) and now considering 107/112 (removed 5) transitions.
[2023-03-22 23:27:50] [INFO ] Flow matrix only has 53 transitions (discarded 54 similar events)
// Phase 1: matrix 53 rows 49 cols
[2023-03-22 23:27:50] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 23:27:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 23:27:50] [INFO ] Flow matrix only has 53 transitions (discarded 54 similar events)
[2023-03-22 23:27:50] [INFO ] Invariant cache hit.
[2023-03-22 23:27:50] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/187 places, 107/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 49/187 places, 107/232 transitions.
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p1) (NOT p2) p3), (OR (NOT p1) (NOT p2) p3), true, (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=p3, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=p3, acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND p1 p0), acceptance={} source=4 dest: 9}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}], [{ cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s18 1) (GEQ s19 1)), p0:(AND (GEQ s18 1) (GEQ s19 1)), p3:(AND (GEQ s36 1) (GEQ s39 1)), p2:(AND (GEQ s15 1) (GEQ s29 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-04 finished in 632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(((p0 U p1)||X(G(!p2)))) U !p0))'
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 169 transition count 214
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 169 transition count 214
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 154 transition count 199
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 154 transition count 199
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 152 transition count 199
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 83 place count 137 transition count 184
Iterating global reduction 1 with 15 rules applied. Total rules applied 98 place count 137 transition count 184
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 104 place count 131 transition count 184
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 116 place count 119 transition count 172
Iterating global reduction 2 with 12 rules applied. Total rules applied 128 place count 119 transition count 172
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 136 place count 111 transition count 164
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 111 transition count 164
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 152 place count 103 transition count 156
Iterating global reduction 2 with 8 rules applied. Total rules applied 160 place count 103 transition count 156
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 171 place count 92 transition count 145
Iterating global reduction 2 with 11 rules applied. Total rules applied 182 place count 92 transition count 145
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 197 place count 77 transition count 130
Iterating global reduction 2 with 15 rules applied. Total rules applied 212 place count 77 transition count 130
Applied a total of 212 rules in 16 ms. Remains 77 /187 variables (removed 110) and now considering 130/232 (removed 102) transitions.
[2023-03-22 23:27:51] [INFO ] Flow matrix only has 85 transitions (discarded 45 similar events)
// Phase 1: matrix 85 rows 77 cols
[2023-03-22 23:27:51] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-22 23:27:51] [INFO ] Implicit Places using invariants in 49 ms returned [54, 58, 62, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/187 places, 130/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 121
Applied a total of 18 rules in 1 ms. Remains 64 /73 variables (removed 9) and now considering 121/130 (removed 9) transitions.
[2023-03-22 23:27:51] [INFO ] Flow matrix only has 73 transitions (discarded 48 similar events)
// Phase 1: matrix 73 rows 64 cols
[2023-03-22 23:27:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 23:27:51] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 23:27:51] [INFO ] Flow matrix only has 73 transitions (discarded 48 similar events)
[2023-03-22 23:27:51] [INFO ] Invariant cache hit.
[2023-03-22 23:27:51] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/187 places, 121/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 64/187 places, 121/232 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (GEQ s26 1) (GEQ s38 1)), p0:(LT s33 1), p1:(AND (GEQ s4 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 5 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-05 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Graph (complete) has 479 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 185 transition count 198
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 153 transition count 198
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 65 place count 153 transition count 183
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 95 place count 138 transition count 183
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 108 place count 125 transition count 170
Iterating global reduction 2 with 13 rules applied. Total rules applied 121 place count 125 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 130 place count 116 transition count 161
Iterating global reduction 2 with 9 rules applied. Total rules applied 139 place count 116 transition count 161
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 142 place count 113 transition count 161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 142 place count 113 transition count 158
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 110 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 107 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 107 transition count 155
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 157 place count 104 transition count 152
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 104 transition count 152
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 196 place count 86 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 202 place count 80 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 208 place count 80 transition count 128
Applied a total of 208 rules in 46 ms. Remains 80 /187 variables (removed 107) and now considering 128/232 (removed 104) transitions.
[2023-03-22 23:27:51] [INFO ] Flow matrix only has 101 transitions (discarded 27 similar events)
// Phase 1: matrix 101 rows 80 cols
[2023-03-22 23:27:51] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-22 23:27:51] [INFO ] Implicit Places using invariants in 60 ms returned [4, 19, 28, 30, 46, 48, 49, 56, 61, 63, 67]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 61 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/187 places, 128/232 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 69 transition count 125
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 125
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 29 place count 43 transition count 102
Iterating global reduction 0 with 23 rules applied. Total rules applied 52 place count 43 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 38 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 38 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 32 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 30 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 30 transition count 89
Applied a total of 78 rules in 9 ms. Remains 30 /69 variables (removed 39) and now considering 89/128 (removed 39) transitions.
[2023-03-22 23:27:51] [INFO ] Flow matrix only has 31 transitions (discarded 58 similar events)
// Phase 1: matrix 31 rows 30 cols
[2023-03-22 23:27:51] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 23:27:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 23:27:51] [INFO ] Flow matrix only has 31 transitions (discarded 58 similar events)
[2023-03-22 23:27:51] [INFO ] Invariant cache hit.
[2023-03-22 23:27:51] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/187 places, 89/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 30/187 places, 89/232 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s16 1), p0:(AND (GEQ s18 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11408 reset in 205 ms.
Product exploration explored 100000 steps with 11474 reset in 165 ms.
Computed a total of 30 stabilizing places and 89 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 89
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-07 finished in 919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G(p0)&&(X(p1) U (X(p1) U p2))&&p0)))))'
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 168 transition count 213
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 168 transition count 213
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 56 place count 150 transition count 195
Iterating global reduction 0 with 18 rules applied. Total rules applied 74 place count 150 transition count 195
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 146 transition count 195
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 98 place count 126 transition count 175
Iterating global reduction 1 with 20 rules applied. Total rules applied 118 place count 126 transition count 175
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 125 place count 119 transition count 175
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 140 place count 104 transition count 160
Iterating global reduction 2 with 15 rules applied. Total rules applied 155 place count 104 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 166 place count 93 transition count 149
Iterating global reduction 2 with 11 rules applied. Total rules applied 177 place count 93 transition count 149
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 188 place count 82 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 199 place count 82 transition count 138
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 213 place count 68 transition count 124
Iterating global reduction 2 with 14 rules applied. Total rules applied 227 place count 68 transition count 124
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 246 place count 49 transition count 105
Iterating global reduction 2 with 19 rules applied. Total rules applied 265 place count 49 transition count 105
Applied a total of 265 rules in 22 ms. Remains 49 /187 variables (removed 138) and now considering 105/232 (removed 127) transitions.
[2023-03-22 23:27:52] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 49 cols
[2023-03-22 23:27:52] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 23:27:52] [INFO ] Implicit Places using invariants in 40 ms returned [32, 36, 40]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/187 places, 105/232 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 41 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 41 transition count 100
Applied a total of 10 rules in 1 ms. Remains 41 /46 variables (removed 5) and now considering 100/105 (removed 5) transitions.
[2023-03-22 23:27:52] [INFO ] Flow matrix only has 42 transitions (discarded 58 similar events)
// Phase 1: matrix 42 rows 41 cols
[2023-03-22 23:27:52] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 23:27:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 23:27:52] [INFO ] Flow matrix only has 42 transitions (discarded 58 similar events)
[2023-03-22 23:27:52] [INFO ] Invariant cache hit.
[2023-03-22 23:27:52] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/187 places, 100/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 41/187 places, 100/232 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s33 1), p2:(AND (GEQ s16 1) (GEQ s30 1)), p1:(AND (GEQ s19 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-08 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&G(p1)))))'
Support contains 7 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 168 transition count 213
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 168 transition count 213
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 152 transition count 197
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 152 transition count 197
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 149 transition count 197
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 90 place count 132 transition count 180
Iterating global reduction 1 with 17 rules applied. Total rules applied 107 place count 132 transition count 180
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 113 place count 126 transition count 180
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 126 place count 113 transition count 167
Iterating global reduction 2 with 13 rules applied. Total rules applied 139 place count 113 transition count 167
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 148 place count 104 transition count 158
Iterating global reduction 2 with 9 rules applied. Total rules applied 157 place count 104 transition count 158
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 166 place count 95 transition count 149
Iterating global reduction 2 with 9 rules applied. Total rules applied 175 place count 95 transition count 149
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 187 place count 83 transition count 137
Iterating global reduction 2 with 12 rules applied. Total rules applied 199 place count 83 transition count 137
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 213 place count 69 transition count 123
Iterating global reduction 2 with 14 rules applied. Total rules applied 227 place count 69 transition count 123
Applied a total of 227 rules in 16 ms. Remains 69 /187 variables (removed 118) and now considering 123/232 (removed 109) transitions.
[2023-03-22 23:27:52] [INFO ] Flow matrix only has 75 transitions (discarded 48 similar events)
// Phase 1: matrix 75 rows 69 cols
[2023-03-22 23:27:52] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-22 23:27:52] [INFO ] Implicit Places using invariants in 47 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/187 places, 123/232 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 119
Applied a total of 8 rules in 2 ms. Remains 63 /67 variables (removed 4) and now considering 119/123 (removed 4) transitions.
[2023-03-22 23:27:52] [INFO ] Flow matrix only has 69 transitions (discarded 50 similar events)
// Phase 1: matrix 69 rows 63 cols
[2023-03-22 23:27:52] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 23:27:53] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 23:27:53] [INFO ] Flow matrix only has 69 transitions (discarded 50 similar events)
[2023-03-22 23:27:53] [INFO ] Invariant cache hit.
[2023-03-22 23:27:53] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/187 places, 119/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 63/187 places, 119/232 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s45 1)), p0:(OR (LT s24 1) (LT s26 1) (AND (GEQ s39 1) (GEQ s53 1)) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-09 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X(F((!p0&&X(F((G(p1)&&X(F(p2)))))))))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 169 transition count 214
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 169 transition count 214
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 154 transition count 199
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 154 transition count 199
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 151 transition count 199
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 85 place count 135 transition count 183
Iterating global reduction 1 with 16 rules applied. Total rules applied 101 place count 135 transition count 183
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 130 transition count 183
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 117 place count 119 transition count 172
Iterating global reduction 2 with 11 rules applied. Total rules applied 128 place count 119 transition count 172
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 136 place count 111 transition count 164
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 111 transition count 164
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 152 place count 103 transition count 156
Iterating global reduction 2 with 8 rules applied. Total rules applied 160 place count 103 transition count 156
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 171 place count 92 transition count 145
Iterating global reduction 2 with 11 rules applied. Total rules applied 182 place count 92 transition count 145
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 196 place count 78 transition count 131
Iterating global reduction 2 with 14 rules applied. Total rules applied 210 place count 78 transition count 131
Applied a total of 210 rules in 11 ms. Remains 78 /187 variables (removed 109) and now considering 131/232 (removed 101) transitions.
[2023-03-22 23:27:53] [INFO ] Flow matrix only has 85 transitions (discarded 46 similar events)
// Phase 1: matrix 85 rows 78 cols
[2023-03-22 23:27:53] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-22 23:27:53] [INFO ] Implicit Places using invariants in 51 ms returned [46, 59, 63, 67]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/187 places, 131/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 65 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 65 transition count 122
Applied a total of 18 rules in 1 ms. Remains 65 /74 variables (removed 9) and now considering 122/131 (removed 9) transitions.
[2023-03-22 23:27:53] [INFO ] Flow matrix only has 73 transitions (discarded 49 similar events)
// Phase 1: matrix 73 rows 65 cols
[2023-03-22 23:27:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 23:27:53] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-22 23:27:53] [INFO ] Flow matrix only has 73 transitions (discarded 49 similar events)
[2023-03-22 23:27:53] [INFO ] Invariant cache hit.
[2023-03-22 23:27:53] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 65/187 places, 122/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 65/187 places, 122/232 transitions.
Stuttering acceptance computed with spot in 280 ms :[p0, p0, (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s19 1), p1:(LT s47 1), p2:(OR (LT s32 1) (LT s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-10 finished in 494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))&&(F(p2)||p1))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 212
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 150 transition count 195
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 150 transition count 195
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 146 transition count 195
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 97 place count 127 transition count 176
Iterating global reduction 1 with 19 rules applied. Total rules applied 116 place count 127 transition count 176
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 122 place count 121 transition count 176
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 136 place count 107 transition count 162
Iterating global reduction 2 with 14 rules applied. Total rules applied 150 place count 107 transition count 162
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 160 place count 97 transition count 152
Iterating global reduction 2 with 10 rules applied. Total rules applied 170 place count 97 transition count 152
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 180 place count 87 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 190 place count 87 transition count 142
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 203 place count 74 transition count 129
Iterating global reduction 2 with 13 rules applied. Total rules applied 216 place count 74 transition count 129
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 231 place count 59 transition count 114
Iterating global reduction 2 with 15 rules applied. Total rules applied 246 place count 59 transition count 114
Applied a total of 246 rules in 11 ms. Remains 59 /187 variables (removed 128) and now considering 114/232 (removed 118) transitions.
[2023-03-22 23:27:53] [INFO ] Flow matrix only has 61 transitions (discarded 53 similar events)
// Phase 1: matrix 61 rows 59 cols
[2023-03-22 23:27:53] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 23:27:53] [INFO ] Implicit Places using invariants in 45 ms returned [38, 42, 46, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/187 places, 114/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 46 transition count 105
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 46 transition count 105
Applied a total of 18 rules in 1 ms. Remains 46 /55 variables (removed 9) and now considering 105/114 (removed 9) transitions.
[2023-03-22 23:27:53] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2023-03-22 23:27:53] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 23:27:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 23:27:53] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
[2023-03-22 23:27:53] [INFO ] Invariant cache hit.
[2023-03-22 23:27:53] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/187 places, 105/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 46/187 places, 105/232 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s8 1) (AND (GEQ s18 1) (GEQ s33 1))), p2:(AND (GEQ s18 1) (GEQ s33 1)), p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-11 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Graph (complete) has 479 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 185 transition count 198
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 153 transition count 198
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 65 place count 153 transition count 183
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 95 place count 138 transition count 183
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 107 place count 126 transition count 171
Iterating global reduction 2 with 12 rules applied. Total rules applied 119 place count 126 transition count 171
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 127 place count 118 transition count 163
Iterating global reduction 2 with 8 rules applied. Total rules applied 135 place count 118 transition count 163
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 116 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 137 place count 116 transition count 161
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 141 place count 114 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 112 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 112 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 110 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 110 transition count 157
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 187 place count 91 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 194 place count 84 transition count 131
Iterating global reduction 3 with 7 rules applied. Total rules applied 201 place count 84 transition count 131
Applied a total of 201 rules in 29 ms. Remains 84 /187 variables (removed 103) and now considering 131/232 (removed 101) transitions.
[2023-03-22 23:27:54] [INFO ] Flow matrix only has 108 transitions (discarded 23 similar events)
// Phase 1: matrix 108 rows 84 cols
[2023-03-22 23:27:54] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-22 23:27:54] [INFO ] Implicit Places using invariants in 58 ms returned [6, 24, 33, 35, 43, 49, 51, 52, 59, 64, 66, 70]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 59 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/187 places, 131/232 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 72 transition count 128
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 128
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 31 place count 44 transition count 103
Iterating global reduction 0 with 25 rules applied. Total rules applied 56 place count 44 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 38 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 38 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 37 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 37 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 33 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 31 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 31 transition count 90
Applied a total of 82 rules in 7 ms. Remains 31 /72 variables (removed 41) and now considering 90/131 (removed 41) transitions.
[2023-03-22 23:27:54] [INFO ] Flow matrix only has 32 transitions (discarded 58 similar events)
// Phase 1: matrix 32 rows 31 cols
[2023-03-22 23:27:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 23:27:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 23:27:54] [INFO ] Flow matrix only has 32 transitions (discarded 58 similar events)
[2023-03-22 23:27:54] [INFO ] Invariant cache hit.
[2023-03-22 23:27:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/187 places, 90/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 31/187 places, 90/232 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s21 1) (GEQ s24 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 6 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-12 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 168 transition count 213
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 168 transition count 213
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 152 transition count 197
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 152 transition count 197
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 148 transition count 197
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 93 place count 129 transition count 178
Iterating global reduction 1 with 19 rules applied. Total rules applied 112 place count 129 transition count 178
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 117 place count 124 transition count 178
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 129 place count 112 transition count 166
Iterating global reduction 2 with 12 rules applied. Total rules applied 141 place count 112 transition count 166
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 150 place count 103 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 159 place count 103 transition count 157
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 168 place count 94 transition count 148
Iterating global reduction 2 with 9 rules applied. Total rules applied 177 place count 94 transition count 148
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 189 place count 82 transition count 136
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 82 transition count 136
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 215 place count 68 transition count 122
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 68 transition count 122
Applied a total of 229 rules in 19 ms. Remains 68 /187 variables (removed 119) and now considering 122/232 (removed 110) transitions.
[2023-03-22 23:27:54] [INFO ] Flow matrix only has 73 transitions (discarded 49 similar events)
// Phase 1: matrix 73 rows 68 cols
[2023-03-22 23:27:54] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-22 23:27:54] [INFO ] Implicit Places using invariants in 41 ms returned [46, 50, 54, 58]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/187 places, 122/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 55 transition count 113
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 55 transition count 113
Applied a total of 18 rules in 1 ms. Remains 55 /64 variables (removed 9) and now considering 113/122 (removed 9) transitions.
[2023-03-22 23:27:54] [INFO ] Flow matrix only has 61 transitions (discarded 52 similar events)
// Phase 1: matrix 61 rows 55 cols
[2023-03-22 23:27:54] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 23:27:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 23:27:54] [INFO ] Flow matrix only has 61 transitions (discarded 52 similar events)
[2023-03-22 23:27:54] [INFO ] Invariant cache hit.
[2023-03-22 23:27:54] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/187 places, 113/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 55/187 places, 113/232 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s11 1) (LT s15 1)), p1:(LT s34 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 55 stabilizing places and 113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 113
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 114 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-13 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Graph (complete) has 479 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 185 transition count 198
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 153 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 152 transition count 197
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 67 place count 152 transition count 182
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 97 place count 137 transition count 182
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 110 place count 124 transition count 169
Iterating global reduction 3 with 13 rules applied. Total rules applied 123 place count 124 transition count 169
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 132 place count 115 transition count 160
Iterating global reduction 3 with 9 rules applied. Total rules applied 141 place count 115 transition count 160
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 144 place count 112 transition count 160
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 144 place count 112 transition count 157
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 150 place count 109 transition count 157
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 153 place count 106 transition count 154
Iterating global reduction 4 with 3 rules applied. Total rules applied 156 place count 106 transition count 154
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 159 place count 103 transition count 151
Iterating global reduction 4 with 3 rules applied. Total rules applied 162 place count 103 transition count 151
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 198 place count 85 transition count 133
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 205 place count 78 transition count 126
Iterating global reduction 4 with 7 rules applied. Total rules applied 212 place count 78 transition count 126
Applied a total of 212 rules in 27 ms. Remains 78 /187 variables (removed 109) and now considering 126/232 (removed 106) transitions.
[2023-03-22 23:27:55] [INFO ] Flow matrix only has 99 transitions (discarded 27 similar events)
// Phase 1: matrix 99 rows 78 cols
[2023-03-22 23:27:55] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-22 23:27:55] [INFO ] Implicit Places using invariants in 61 ms returned [4, 19, 28, 30, 38, 44, 46, 47, 54, 61, 65]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 62 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/187 places, 126/232 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 49 transition count 108
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 49 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 43 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 43 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 36 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 36 transition count 95
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 32 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 30 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 30 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 29 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 29 transition count 88
Applied a total of 76 rules in 7 ms. Remains 29 /67 variables (removed 38) and now considering 88/126 (removed 38) transitions.
[2023-03-22 23:27:55] [INFO ] Flow matrix only has 28 transitions (discarded 60 similar events)
// Phase 1: matrix 28 rows 29 cols
[2023-03-22 23:27:55] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 23:27:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 23:27:55] [INFO ] Flow matrix only has 28 transitions (discarded 60 similar events)
[2023-03-22 23:27:55] [INFO ] Invariant cache hit.
[2023-03-22 23:27:55] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/187 places, 88/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 29/187 places, 88/232 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-14 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||G(p1))))||F(p0)))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 212
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 150 transition count 195
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 150 transition count 195
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 77 place count 147 transition count 195
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 95 place count 129 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 113 place count 129 transition count 177
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 120 place count 122 transition count 177
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 134 place count 108 transition count 163
Iterating global reduction 2 with 14 rules applied. Total rules applied 148 place count 108 transition count 163
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 158 place count 98 transition count 153
Iterating global reduction 2 with 10 rules applied. Total rules applied 168 place count 98 transition count 153
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 178 place count 88 transition count 143
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 88 transition count 143
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 201 place count 75 transition count 130
Iterating global reduction 2 with 13 rules applied. Total rules applied 214 place count 75 transition count 130
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 232 place count 57 transition count 112
Iterating global reduction 2 with 18 rules applied. Total rules applied 250 place count 57 transition count 112
Applied a total of 250 rules in 12 ms. Remains 57 /187 variables (removed 130) and now considering 112/232 (removed 120) transitions.
[2023-03-22 23:27:55] [INFO ] Flow matrix only has 60 transitions (discarded 52 similar events)
// Phase 1: matrix 60 rows 57 cols
[2023-03-22 23:27:55] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 23:27:55] [INFO ] Implicit Places using invariants in 57 ms returned [36, 44, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/187 places, 112/232 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 107
Applied a total of 10 rules in 1 ms. Remains 49 /54 variables (removed 5) and now considering 107/112 (removed 5) transitions.
[2023-03-22 23:27:55] [INFO ] Flow matrix only has 53 transitions (discarded 54 similar events)
// Phase 1: matrix 53 rows 49 cols
[2023-03-22 23:27:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 23:27:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 23:27:55] [INFO ] Flow matrix only has 53 transitions (discarded 54 similar events)
[2023-03-22 23:27:55] [INFO ] Invariant cache hit.
[2023-03-22 23:27:55] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/187 places, 107/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 49/187 places, 107/232 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s14 1)), p1:(AND (GEQ s31 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-15 finished in 298 ms.
All properties solved by simple procedures.
Total runtime 9203 ms.
ITS solved all properties within timeout

BK_STOP 1679527677093

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LeafsetExtension-PT-S08C2, 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 r233-tall-167856418900452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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