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.r231-tall-167856416100476.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 lolaxred
Input is LeafsetExtension-PT-S16C2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416100476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 11K Feb 25 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K 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 3.9K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 25 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:52 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 905K 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-S16C2-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679458763249

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C2
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 04:19:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:19:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:19:25] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-22 04:19:25] [INFO ] Transformed 1542 places.
[2023-03-22 04:19:25] [INFO ] Transformed 1449 transitions.
[2023-03-22 04:19:25] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 178 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 4 formulas.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 293 place count 1249 transition count 1449
Discarding 265 places :
Symmetric choice reduction at 1 with 265 rule applications. Total rules 558 place count 984 transition count 1184
Iterating global reduction 1 with 265 rules applied. Total rules applied 823 place count 984 transition count 1184
Discarding 226 places :
Symmetric choice reduction at 1 with 226 rule applications. Total rules 1049 place count 758 transition count 958
Iterating global reduction 1 with 226 rules applied. Total rules applied 1275 place count 758 transition count 958
Discarding 220 places :
Symmetric choice reduction at 1 with 220 rule applications. Total rules 1495 place count 538 transition count 738
Iterating global reduction 1 with 220 rules applied. Total rules applied 1715 place count 538 transition count 738
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 1 with 17 rules applied. Total rules applied 1732 place count 521 transition count 738
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1747 place count 506 transition count 723
Iterating global reduction 2 with 15 rules applied. Total rules applied 1762 place count 506 transition count 723
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1777 place count 491 transition count 708
Iterating global reduction 2 with 15 rules applied. Total rules applied 1792 place count 491 transition count 708
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1806 place count 477 transition count 694
Iterating global reduction 2 with 14 rules applied. Total rules applied 1820 place count 477 transition count 694
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1834 place count 463 transition count 680
Iterating global reduction 2 with 14 rules applied. Total rules applied 1848 place count 463 transition count 680
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 1941 place count 370 transition count 587
Iterating global reduction 2 with 93 rules applied. Total rules applied 2034 place count 370 transition count 587
Applied a total of 2034 rules in 326 ms. Remains 370 /1542 variables (removed 1172) and now considering 587/1449 (removed 862) transitions.
[2023-03-22 04:19:25] [INFO ] Flow matrix only has 494 transitions (discarded 93 similar events)
// Phase 1: matrix 494 rows 370 cols
[2023-03-22 04:19:25] [INFO ] Computed 37 place invariants in 39 ms
[2023-03-22 04:19:26] [INFO ] Implicit Places using invariants in 425 ms returned [27, 44, 58, 62, 122, 147, 161, 181, 183, 186, 226, 245, 249, 261, 300, 307, 312]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 452 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/1542 places, 587/1449 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 268 transition count 502
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 268 transition count 502
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 175 place count 263 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 180 place count 263 transition count 497
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 185 place count 258 transition count 492
Iterating global reduction 0 with 5 rules applied. Total rules applied 190 place count 258 transition count 492
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 195 place count 253 transition count 487
Iterating global reduction 0 with 5 rules applied. Total rules applied 200 place count 253 transition count 487
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 215 place count 238 transition count 472
Iterating global reduction 0 with 15 rules applied. Total rules applied 230 place count 238 transition count 472
Applied a total of 230 rules in 34 ms. Remains 238 /353 variables (removed 115) and now considering 472/587 (removed 115) transitions.
[2023-03-22 04:19:26] [INFO ] Flow matrix only has 337 transitions (discarded 135 similar events)
// Phase 1: matrix 337 rows 238 cols
[2023-03-22 04:19:26] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-22 04:19:26] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-22 04:19:26] [INFO ] Flow matrix only has 337 transitions (discarded 135 similar events)
[2023-03-22 04:19:26] [INFO ] Invariant cache hit.
[2023-03-22 04:19:26] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 238/1542 places, 472/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1163 ms. Remains : 238/1542 places, 472/1449 transitions.
Support contains 48 out of 238 places after structural reductions.
[2023-03-22 04:19:26] [INFO ] Flatten gal took : 62 ms
[2023-03-22 04:19:26] [INFO ] Flatten gal took : 25 ms
[2023-03-22 04:19:26] [INFO ] Input system was already deterministic with 472 transitions.
Support contains 46 out of 238 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 28) seen :25
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 04:19:27] [INFO ] Flow matrix only has 337 transitions (discarded 135 similar events)
[2023-03-22 04:19:27] [INFO ] Invariant cache hit.
[2023-03-22 04:19:27] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-22 04:19:27] [INFO ] After 110ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-22 04:19:27] [INFO ] After 160ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-22 04:19:27] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 472/472 transitions.
Graph (complete) has 624 edges and 238 vertex of which 61 are kept as prefixes of interest. Removing 177 places using SCC suffix rule.4 ms
Discarding 177 places :
Also discarding 132 output transitions
Drop transitions removed 132 transitions
Drop transitions removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 160 rules applied. Total rules applied 161 place count 60 transition count 181
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 225 place count 51 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 227 place count 49 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 227 place count 49 transition count 124
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 231 place count 47 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 236 place count 42 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 241 place count 42 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 42 transition count 118
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 252 place count 37 transition count 113
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 256 place count 37 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 258 place count 37 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 260 place count 35 transition count 107
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 267 place count 35 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 274 place count 28 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 28 transition count 100
Applied a total of 275 rules in 36 ms. Remains 28 /238 variables (removed 210) and now considering 100/472 (removed 372) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 28/238 places, 100/472 transitions.
Incomplete random walk after 10000 steps, including 2080 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :1
Finished Best-First random walk after 619 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=619 )
Computed a total of 238 stabilizing places and 472 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 472
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' '!(G(F((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 215 transition count 449
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 215 transition count 449
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 64 place count 197 transition count 431
Iterating global reduction 0 with 18 rules applied. Total rules applied 82 place count 197 transition count 431
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 87 place count 192 transition count 431
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 105 place count 174 transition count 413
Iterating global reduction 1 with 18 rules applied. Total rules applied 123 place count 174 transition count 413
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 168 transition count 413
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 144 place count 153 transition count 398
Iterating global reduction 2 with 15 rules applied. Total rules applied 159 place count 153 transition count 398
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 170 place count 142 transition count 387
Iterating global reduction 2 with 11 rules applied. Total rules applied 181 place count 142 transition count 387
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 192 place count 131 transition count 376
Iterating global reduction 2 with 11 rules applied. Total rules applied 203 place count 131 transition count 376
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 229 place count 105 transition count 350
Iterating global reduction 2 with 26 rules applied. Total rules applied 255 place count 105 transition count 350
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 280 place count 80 transition count 325
Iterating global reduction 2 with 25 rules applied. Total rules applied 305 place count 80 transition count 325
Applied a total of 305 rules in 43 ms. Remains 80 /238 variables (removed 158) and now considering 325/472 (removed 147) transitions.
[2023-03-22 04:19:28] [INFO ] Flow matrix only has 85 transitions (discarded 240 similar events)
// Phase 1: matrix 85 rows 80 cols
[2023-03-22 04:19:28] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-22 04:19:28] [INFO ] Implicit Places using invariants in 130 ms returned [33, 37, 43, 51, 61, 71]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 131 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/238 places, 325/472 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 61 transition count 312
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 61 transition count 312
Applied a total of 26 rules in 1 ms. Remains 61 /74 variables (removed 13) and now considering 312/325 (removed 13) transitions.
[2023-03-22 04:19:28] [INFO ] Flow matrix only has 68 transitions (discarded 244 similar events)
// Phase 1: matrix 68 rows 61 cols
[2023-03-22 04:19:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:19:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-22 04:19:28] [INFO ] Flow matrix only has 68 transitions (discarded 244 similar events)
[2023-03-22 04:19:28] [INFO ] Invariant cache hit.
[2023-03-22 04:19:28] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/238 places, 312/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 348 ms. Remains : 61/238 places, 312/472 transitions.
Stuttering acceptance computed with spot in 285 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s31 1) (GEQ s44 1) (GEQ s21 1) (GEQ s23 1)), p1:(AND (GEQ s31 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32077 reset in 422 ms.
Product exploration explored 100000 steps with 31898 reset in 256 ms.
Computed a total of 61 stabilizing places and 312 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 312
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-00 finished in 1724 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)&&F(p2)&&G(p0))))'
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 215 transition count 449
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 215 transition count 449
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 196 transition count 430
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 196 transition count 430
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 90 place count 190 transition count 430
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 110 place count 170 transition count 410
Iterating global reduction 1 with 20 rules applied. Total rules applied 130 place count 170 transition count 410
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 136 place count 164 transition count 410
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 152 place count 148 transition count 394
Iterating global reduction 2 with 16 rules applied. Total rules applied 168 place count 148 transition count 394
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 180 place count 136 transition count 382
Iterating global reduction 2 with 12 rules applied. Total rules applied 192 place count 136 transition count 382
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 204 place count 124 transition count 370
Iterating global reduction 2 with 12 rules applied. Total rules applied 216 place count 124 transition count 370
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 245 place count 95 transition count 341
Iterating global reduction 2 with 29 rules applied. Total rules applied 274 place count 95 transition count 341
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 299 place count 70 transition count 316
Iterating global reduction 2 with 25 rules applied. Total rules applied 324 place count 70 transition count 316
Applied a total of 324 rules in 21 ms. Remains 70 /238 variables (removed 168) and now considering 316/472 (removed 156) transitions.
[2023-03-22 04:19:29] [INFO ] Flow matrix only has 68 transitions (discarded 248 similar events)
// Phase 1: matrix 68 rows 70 cols
[2023-03-22 04:19:29] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-22 04:19:29] [INFO ] Implicit Places using invariants in 69 ms returned [23, 27, 33, 52, 62]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 77 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/238 places, 316/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 56 transition count 307
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 56 transition count 307
Applied a total of 18 rules in 2 ms. Remains 56 /65 variables (removed 9) and now considering 307/316 (removed 9) transitions.
[2023-03-22 04:19:30] [INFO ] Flow matrix only has 55 transitions (discarded 252 similar events)
// Phase 1: matrix 55 rows 56 cols
[2023-03-22 04:19:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:19:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 04:19:30] [INFO ] Flow matrix only has 55 transitions (discarded 252 similar events)
[2023-03-22 04:19:30] [INFO ] Invariant cache hit.
[2023-03-22 04:19:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/238 places, 307/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 56/238 places, 307/472 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0 p2), acceptance={0} source=5 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (GEQ s14 1) (GEQ s34 1)), p2:(AND (GEQ s0 1) (GEQ s26 1)), p1:(AND (GEQ s27 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-01 finished in 486 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))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 450
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 450
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 199 transition count 433
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 199 transition count 433
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 83 place count 194 transition count 433
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 101 place count 176 transition count 415
Iterating global reduction 1 with 18 rules applied. Total rules applied 119 place count 176 transition count 415
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 125 place count 170 transition count 415
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 140 place count 155 transition count 400
Iterating global reduction 2 with 15 rules applied. Total rules applied 155 place count 155 transition count 400
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 166 place count 144 transition count 389
Iterating global reduction 2 with 11 rules applied. Total rules applied 177 place count 144 transition count 389
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 188 place count 133 transition count 378
Iterating global reduction 2 with 11 rules applied. Total rules applied 199 place count 133 transition count 378
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 223 place count 109 transition count 354
Iterating global reduction 2 with 24 rules applied. Total rules applied 247 place count 109 transition count 354
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 272 place count 84 transition count 329
Iterating global reduction 2 with 25 rules applied. Total rules applied 297 place count 84 transition count 329
Applied a total of 297 rules in 21 ms. Remains 84 /238 variables (removed 154) and now considering 329/472 (removed 143) transitions.
[2023-03-22 04:19:30] [INFO ] Flow matrix only has 90 transitions (discarded 239 similar events)
// Phase 1: matrix 90 rows 84 cols
[2023-03-22 04:19:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-22 04:19:30] [INFO ] Implicit Places using invariants in 68 ms returned [23, 27, 45, 53, 65, 75]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 69 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/238 places, 329/472 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 63 transition count 314
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 63 transition count 314
Applied a total of 30 rules in 2 ms. Remains 63 /78 variables (removed 15) and now considering 314/329 (removed 15) transitions.
[2023-03-22 04:19:30] [INFO ] Flow matrix only has 71 transitions (discarded 243 similar events)
// Phase 1: matrix 71 rows 63 cols
[2023-03-22 04:19:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:19:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-22 04:19:30] [INFO ] Flow matrix only has 71 transitions (discarded 243 similar events)
[2023-03-22 04:19:30] [INFO ] Invariant cache hit.
[2023-03-22 04:19:30] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/238 places, 314/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 63/238 places, 314/472 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s43 1), p0:(OR (LT s25 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1564 steps with 84 reset in 12 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-03 finished in 405 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(p1))&&p0)))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 450
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 450
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 199 transition count 433
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 199 transition count 433
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 83 place count 194 transition count 433
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 101 place count 176 transition count 415
Iterating global reduction 1 with 18 rules applied. Total rules applied 119 place count 176 transition count 415
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 125 place count 170 transition count 415
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 140 place count 155 transition count 400
Iterating global reduction 2 with 15 rules applied. Total rules applied 155 place count 155 transition count 400
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 166 place count 144 transition count 389
Iterating global reduction 2 with 11 rules applied. Total rules applied 177 place count 144 transition count 389
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 188 place count 133 transition count 378
Iterating global reduction 2 with 11 rules applied. Total rules applied 199 place count 133 transition count 378
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 224 place count 108 transition count 353
Iterating global reduction 2 with 25 rules applied. Total rules applied 249 place count 108 transition count 353
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 274 place count 83 transition count 328
Iterating global reduction 2 with 25 rules applied. Total rules applied 299 place count 83 transition count 328
Applied a total of 299 rules in 17 ms. Remains 83 /238 variables (removed 155) and now considering 328/472 (removed 144) transitions.
[2023-03-22 04:19:30] [INFO ] Flow matrix only has 88 transitions (discarded 240 similar events)
// Phase 1: matrix 88 rows 83 cols
[2023-03-22 04:19:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-22 04:19:30] [INFO ] Implicit Places using invariants in 62 ms returned [25, 29, 35, 43, 64, 74]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 62 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/238 places, 328/472 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 63 transition count 314
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 63 transition count 314
Applied a total of 28 rules in 2 ms. Remains 63 /77 variables (removed 14) and now considering 314/328 (removed 14) transitions.
[2023-03-22 04:19:30] [INFO ] Flow matrix only has 70 transitions (discarded 244 similar events)
// Phase 1: matrix 70 rows 63 cols
[2023-03-22 04:19:30] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:19:30] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 04:19:30] [INFO ] Flow matrix only has 70 transitions (discarded 244 similar events)
[2023-03-22 04:19:30] [INFO ] Invariant cache hit.
[2023-03-22 04:19:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/238 places, 314/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 63/238 places, 314/472 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s37 1) (GEQ s39 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-04 finished in 339 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(G((F(G(p0)) U !p0)))))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 215 transition count 449
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 215 transition count 449
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 64 place count 197 transition count 431
Iterating global reduction 0 with 18 rules applied. Total rules applied 82 place count 197 transition count 431
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 88 place count 191 transition count 431
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 107 place count 172 transition count 412
Iterating global reduction 1 with 19 rules applied. Total rules applied 126 place count 172 transition count 412
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 131 place count 167 transition count 412
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 145 place count 153 transition count 398
Iterating global reduction 2 with 14 rules applied. Total rules applied 159 place count 153 transition count 398
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 170 place count 142 transition count 387
Iterating global reduction 2 with 11 rules applied. Total rules applied 181 place count 142 transition count 387
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 192 place count 131 transition count 376
Iterating global reduction 2 with 11 rules applied. Total rules applied 203 place count 131 transition count 376
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 231 place count 103 transition count 348
Iterating global reduction 2 with 28 rules applied. Total rules applied 259 place count 103 transition count 348
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 280 place count 82 transition count 327
Iterating global reduction 2 with 21 rules applied. Total rules applied 301 place count 82 transition count 327
Applied a total of 301 rules in 32 ms. Remains 82 /238 variables (removed 156) and now considering 327/472 (removed 145) transitions.
[2023-03-22 04:19:31] [INFO ] Flow matrix only has 87 transitions (discarded 240 similar events)
// Phase 1: matrix 87 rows 82 cols
[2023-03-22 04:19:31] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-22 04:19:31] [INFO ] Implicit Places using invariants in 65 ms returned [23, 27, 33, 41, 63, 73]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 67 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/238 places, 327/472 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 62 transition count 313
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 62 transition count 313
Applied a total of 28 rules in 3 ms. Remains 62 /76 variables (removed 14) and now considering 313/327 (removed 14) transitions.
[2023-03-22 04:19:31] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
// Phase 1: matrix 69 rows 62 cols
[2023-03-22 04:19:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:19:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 04:19:31] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
[2023-03-22 04:19:31] [INFO ] Invariant cache hit.
[2023-03-22 04:19:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 62/238 places, 313/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 226 ms. Remains : 62/238 places, 313/472 transitions.
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, true]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LT s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-05 finished in 398 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((X(p0)&&(p1||F(p2)))))'
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 217 transition count 451
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 217 transition count 451
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 200 transition count 434
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 200 transition count 434
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 196 transition count 434
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 97 place count 179 transition count 417
Iterating global reduction 1 with 17 rules applied. Total rules applied 114 place count 179 transition count 417
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 173 transition count 417
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 134 place count 159 transition count 403
Iterating global reduction 2 with 14 rules applied. Total rules applied 148 place count 159 transition count 403
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 158 place count 149 transition count 393
Iterating global reduction 2 with 10 rules applied. Total rules applied 168 place count 149 transition count 393
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 178 place count 139 transition count 383
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 139 transition count 383
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 209 place count 118 transition count 362
Iterating global reduction 2 with 21 rules applied. Total rules applied 230 place count 118 transition count 362
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 255 place count 93 transition count 337
Iterating global reduction 2 with 25 rules applied. Total rules applied 280 place count 93 transition count 337
Applied a total of 280 rules in 16 ms. Remains 93 /238 variables (removed 145) and now considering 337/472 (removed 135) transitions.
[2023-03-22 04:19:31] [INFO ] Flow matrix only has 106 transitions (discarded 231 similar events)
// Phase 1: matrix 106 rows 93 cols
[2023-03-22 04:19:31] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-22 04:19:31] [INFO ] Implicit Places using invariants in 70 ms returned [37, 44, 52, 62, 83]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 70 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/238 places, 337/472 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 324
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 324
Applied a total of 26 rules in 2 ms. Remains 75 /88 variables (removed 13) and now considering 324/337 (removed 13) transitions.
[2023-03-22 04:19:31] [INFO ] Flow matrix only has 90 transitions (discarded 234 similar events)
// Phase 1: matrix 90 rows 75 cols
[2023-03-22 04:19:31] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 04:19:31] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-22 04:19:31] [INFO ] Flow matrix only has 90 transitions (discarded 234 similar events)
[2023-03-22 04:19:31] [INFO ] Invariant cache hit.
[2023-03-22 04:19:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 75/238 places, 324/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 75/238 places, 324/472 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s18 1) (GEQ s60 1)), p2:(AND (GEQ s22 1) (GEQ s28 1)), p0:(OR (LT s55 1) (LT s57 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 3 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-08 finished in 567 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((G(F(p0)) U p1))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 450
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 450
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 199 transition count 433
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 199 transition count 433
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 83 place count 194 transition count 433
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 101 place count 176 transition count 415
Iterating global reduction 1 with 18 rules applied. Total rules applied 119 place count 176 transition count 415
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 124 place count 171 transition count 415
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 138 place count 157 transition count 401
Iterating global reduction 2 with 14 rules applied. Total rules applied 152 place count 157 transition count 401
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 162 place count 147 transition count 391
Iterating global reduction 2 with 10 rules applied. Total rules applied 172 place count 147 transition count 391
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 182 place count 137 transition count 381
Iterating global reduction 2 with 10 rules applied. Total rules applied 192 place count 137 transition count 381
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 217 place count 112 transition count 356
Iterating global reduction 2 with 25 rules applied. Total rules applied 242 place count 112 transition count 356
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 264 place count 90 transition count 334
Iterating global reduction 2 with 22 rules applied. Total rules applied 286 place count 90 transition count 334
Applied a total of 286 rules in 12 ms. Remains 90 /238 variables (removed 148) and now considering 334/472 (removed 138) transitions.
[2023-03-22 04:19:32] [INFO ] Flow matrix only has 102 transitions (discarded 232 similar events)
// Phase 1: matrix 102 rows 90 cols
[2023-03-22 04:19:32] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-22 04:19:32] [INFO ] Implicit Places using invariants in 97 ms returned [23, 27, 33, 50, 60, 80]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 98 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/238 places, 334/472 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 71 transition count 321
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 71 transition count 321
Applied a total of 26 rules in 4 ms. Remains 71 /84 variables (removed 13) and now considering 321/334 (removed 13) transitions.
[2023-03-22 04:19:32] [INFO ] Flow matrix only has 85 transitions (discarded 236 similar events)
// Phase 1: matrix 85 rows 71 cols
[2023-03-22 04:19:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:19:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-22 04:19:32] [INFO ] Flow matrix only has 85 transitions (discarded 236 similar events)
[2023-03-22 04:19:32] [INFO ] Invariant cache hit.
[2023-03-22 04:19:32] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 71/238 places, 321/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 240 ms. Remains : 71/238 places, 321/472 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s58 1), p0:(AND (GEQ s31 1) (GEQ s33 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]]
Stuttering criterion allowed to conclude after 1614 steps with 88 reset in 5 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-10 finished in 463 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||G(p1))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Graph (complete) has 930 edges and 238 vertex of which 237 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 237 transition count 448
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 214 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 213 transition count 447
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 49 place count 213 transition count 434
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 200 transition count 434
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 90 place count 185 transition count 419
Iterating global reduction 3 with 15 rules applied. Total rules applied 105 place count 185 transition count 419
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 180 transition count 414
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 180 transition count 414
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 176 transition count 414
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 119 place count 176 transition count 410
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 127 place count 172 transition count 410
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 168 transition count 406
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 168 transition count 406
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 139 place count 164 transition count 402
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 164 transition count 402
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 155 place count 152 transition count 390
Iterating global reduction 4 with 12 rules applied. Total rules applied 167 place count 152 transition count 390
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 223 place count 124 transition count 362
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 236 place count 111 transition count 349
Iterating global reduction 4 with 13 rules applied. Total rules applied 249 place count 111 transition count 349
Applied a total of 249 rules in 58 ms. Remains 111 /238 variables (removed 127) and now considering 349/472 (removed 123) transitions.
[2023-03-22 04:19:32] [INFO ] Flow matrix only has 165 transitions (discarded 184 similar events)
// Phase 1: matrix 165 rows 111 cols
[2023-03-22 04:19:32] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-22 04:19:32] [INFO ] Implicit Places using invariants in 82 ms returned [12, 21, 25, 31, 33, 42, 51, 67, 76, 88, 93, 98]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 83 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/238 places, 349/472 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 75 transition count 325
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 75 transition count 325
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 70 transition count 320
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 70 transition count 320
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 64 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 64 transition count 314
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 57 transition count 307
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 55 transition count 305
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 55 transition count 305
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 53 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 53 transition count 303
Applied a total of 92 rules in 19 ms. Remains 53 /99 variables (removed 46) and now considering 303/349 (removed 46) transitions.
[2023-03-22 04:19:32] [INFO ] Flow matrix only has 60 transitions (discarded 243 similar events)
// Phase 1: matrix 60 rows 53 cols
[2023-03-22 04:19:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:19:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-22 04:19:32] [INFO ] Flow matrix only has 60 transitions (discarded 243 similar events)
[2023-03-22 04:19:32] [INFO ] Invariant cache hit.
[2023-03-22 04:19:32] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/238 places, 303/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 275 ms. Remains : 53/238 places, 303/472 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s37 1) (GEQ s42 1) (GEQ s30 1)), p0:(GEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-11 finished in 320 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 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 216 transition count 450
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 216 transition count 450
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 199 transition count 433
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 199 transition count 433
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 193 transition count 433
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 100 place count 177 transition count 417
Iterating global reduction 1 with 16 rules applied. Total rules applied 116 place count 177 transition count 417
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 122 place count 171 transition count 417
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 138 place count 155 transition count 401
Iterating global reduction 2 with 16 rules applied. Total rules applied 154 place count 155 transition count 401
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 166 place count 143 transition count 389
Iterating global reduction 2 with 12 rules applied. Total rules applied 178 place count 143 transition count 389
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 190 place count 131 transition count 377
Iterating global reduction 2 with 12 rules applied. Total rules applied 202 place count 131 transition count 377
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 231 place count 102 transition count 348
Iterating global reduction 2 with 29 rules applied. Total rules applied 260 place count 102 transition count 348
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 285 place count 77 transition count 323
Iterating global reduction 2 with 25 rules applied. Total rules applied 310 place count 77 transition count 323
Applied a total of 310 rules in 23 ms. Remains 77 /238 variables (removed 161) and now considering 323/472 (removed 149) transitions.
[2023-03-22 04:19:32] [INFO ] Flow matrix only has 84 transitions (discarded 239 similar events)
// Phase 1: matrix 84 rows 77 cols
[2023-03-22 04:19:32] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-22 04:19:32] [INFO ] Implicit Places using invariants in 59 ms returned [23, 27, 33, 43, 59, 69]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 60 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/238 places, 323/472 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 57 transition count 309
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 57 transition count 309
Applied a total of 28 rules in 2 ms. Remains 57 /71 variables (removed 14) and now considering 309/323 (removed 14) transitions.
[2023-03-22 04:19:32] [INFO ] Flow matrix only has 66 transitions (discarded 243 similar events)
// Phase 1: matrix 66 rows 57 cols
[2023-03-22 04:19:32] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 04:19:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-22 04:19:33] [INFO ] Flow matrix only has 66 transitions (discarded 243 similar events)
[2023-03-22 04:19:33] [INFO ] Invariant cache hit.
[2023-03-22 04:19:33] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/238 places, 309/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 57/238 places, 309/472 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s34 1) (GEQ s51 1)), p0:(LT s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5485 reset in 158 ms.
Product exploration explored 100000 steps with 5494 reset in 167 ms.
Computed a total of 57 stabilizing places and 309 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 57 transition count 309
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 p1) p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-12 finished in 837 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||G(p1))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Graph (complete) has 930 edges and 238 vertex of which 237 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 237 transition count 449
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 215 transition count 446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 212 transition count 446
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 51 place count 212 transition count 433
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 77 place count 199 transition count 433
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 92 place count 184 transition count 418
Iterating global reduction 3 with 15 rules applied. Total rules applied 107 place count 184 transition count 418
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 113 place count 178 transition count 412
Iterating global reduction 3 with 6 rules applied. Total rules applied 119 place count 178 transition count 412
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 174 transition count 412
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 123 place count 174 transition count 408
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 131 place count 170 transition count 408
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 135 place count 166 transition count 404
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 166 transition count 404
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 162 transition count 400
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 162 transition count 400
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 159 place count 150 transition count 388
Iterating global reduction 4 with 12 rules applied. Total rules applied 171 place count 150 transition count 388
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 227 place count 122 transition count 360
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 240 place count 109 transition count 347
Iterating global reduction 4 with 13 rules applied. Total rules applied 253 place count 109 transition count 347
Applied a total of 253 rules in 52 ms. Remains 109 /238 variables (removed 129) and now considering 347/472 (removed 125) transitions.
[2023-03-22 04:19:33] [INFO ] Flow matrix only has 162 transitions (discarded 185 similar events)
// Phase 1: matrix 162 rows 109 cols
[2023-03-22 04:19:33] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-22 04:19:33] [INFO ] Implicit Places using invariants in 87 ms returned [23, 27, 33, 35, 44, 51, 57, 65, 71, 74, 86, 91]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 88 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/238 places, 347/472 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 72 transition count 322
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 72 transition count 322
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 67 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 67 transition count 317
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 60 transition count 310
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 60 transition count 310
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 90 place count 52 transition count 302
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 50 transition count 300
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 50 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 49 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 49 transition count 299
Applied a total of 96 rules in 15 ms. Remains 49 /97 variables (removed 48) and now considering 299/347 (removed 48) transitions.
[2023-03-22 04:19:33] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
// Phase 1: matrix 54 rows 49 cols
[2023-03-22 04:19:33] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:19:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-22 04:19:33] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
[2023-03-22 04:19:33] [INFO ] Invariant cache hit.
[2023-03-22 04:19:33] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/238 places, 299/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 49/238 places, 299/472 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s37 1) (LT s43 1)), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11506 reset in 166 ms.
Product exploration explored 100000 steps with 11518 reset in 176 ms.
Computed a total of 49 stabilizing places and 299 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 299
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 (AND p1 (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT 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 190 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-13 finished in 924 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) U (p1&&(G(!p2)||(!p2&&F(p0))))))'
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Graph (complete) has 930 edges and 238 vertex of which 237 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 237 transition count 446
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 212 transition count 446
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 51 place count 212 transition count 433
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 77 place count 199 transition count 433
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 93 place count 183 transition count 417
Iterating global reduction 2 with 16 rules applied. Total rules applied 109 place count 183 transition count 417
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 177 transition count 411
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 177 transition count 411
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 125 place count 173 transition count 411
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 125 place count 173 transition count 407
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 133 place count 169 transition count 407
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 165 transition count 403
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 165 transition count 403
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 161 transition count 399
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 161 transition count 399
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 161 place count 149 transition count 387
Iterating global reduction 3 with 12 rules applied. Total rules applied 173 place count 149 transition count 387
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 229 place count 121 transition count 359
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 242 place count 108 transition count 346
Iterating global reduction 3 with 13 rules applied. Total rules applied 255 place count 108 transition count 346
Applied a total of 255 rules in 37 ms. Remains 108 /238 variables (removed 130) and now considering 346/472 (removed 126) transitions.
[2023-03-22 04:19:34] [INFO ] Flow matrix only has 160 transitions (discarded 186 similar events)
// Phase 1: matrix 160 rows 108 cols
[2023-03-22 04:19:34] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 04:19:34] [INFO ] Implicit Places using invariants in 84 ms returned [12, 21, 31, 33, 42, 49, 55, 63, 69, 72, 90, 95]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 85 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/238 places, 346/472 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 72 transition count 322
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 72 transition count 322
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 67 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 67 transition count 317
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 61 transition count 311
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 61 transition count 311
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 54 transition count 304
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 52 transition count 302
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 52 transition count 302
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 50 transition count 300
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 50 transition count 300
Applied a total of 92 rules in 13 ms. Remains 50 /96 variables (removed 46) and now considering 300/346 (removed 46) transitions.
[2023-03-22 04:19:34] [INFO ] Flow matrix only has 55 transitions (discarded 245 similar events)
// Phase 1: matrix 55 rows 50 cols
[2023-03-22 04:19:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 04:19:34] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 04:19:34] [INFO ] Flow matrix only has 55 transitions (discarded 245 similar events)
[2023-03-22 04:19:34] [INFO ] Invariant cache hit.
[2023-03-22 04:19:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/238 places, 300/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 243 ms. Remains : 50/238 places, 300/472 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) p2), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s42 1), p2:(AND (GEQ s12 1) (GEQ s40 1)), p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-14 finished in 377 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))) U (!p2&&X(F(!p3)))))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 472/472 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 217 transition count 451
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 217 transition count 451
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 200 transition count 434
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 200 transition count 434
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 194 transition count 434
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 102 place count 174 transition count 414
Iterating global reduction 1 with 20 rules applied. Total rules applied 122 place count 174 transition count 414
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 128 place count 168 transition count 414
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 144 place count 152 transition count 398
Iterating global reduction 2 with 16 rules applied. Total rules applied 160 place count 152 transition count 398
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 172 place count 140 transition count 386
Iterating global reduction 2 with 12 rules applied. Total rules applied 184 place count 140 transition count 386
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 196 place count 128 transition count 374
Iterating global reduction 2 with 12 rules applied. Total rules applied 208 place count 128 transition count 374
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 237 place count 99 transition count 345
Iterating global reduction 2 with 29 rules applied. Total rules applied 266 place count 99 transition count 345
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 291 place count 74 transition count 320
Iterating global reduction 2 with 25 rules applied. Total rules applied 316 place count 74 transition count 320
Applied a total of 316 rules in 19 ms. Remains 74 /238 variables (removed 164) and now considering 320/472 (removed 152) transitions.
[2023-03-22 04:19:35] [INFO ] Flow matrix only has 75 transitions (discarded 245 similar events)
// Phase 1: matrix 75 rows 74 cols
[2023-03-22 04:19:35] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-22 04:19:35] [INFO ] Implicit Places using invariants in 55 ms returned [26, 30, 46, 56, 66]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 56 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/238 places, 320/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 60 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 60 transition count 311
Applied a total of 18 rules in 2 ms. Remains 60 /69 variables (removed 9) and now considering 311/320 (removed 9) transitions.
[2023-03-22 04:19:35] [INFO ] Flow matrix only has 63 transitions (discarded 248 similar events)
// Phase 1: matrix 63 rows 60 cols
[2023-03-22 04:19:35] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:19:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-22 04:19:35] [INFO ] Flow matrix only has 63 transitions (discarded 248 similar events)
[2023-03-22 04:19:35] [INFO ] Invariant cache hit.
[2023-03-22 04:19:35] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 60/238 places, 311/472 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 60/238 places, 311/472 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR p3 p2), (AND (NOT p1) (NOT p0)), p3, true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=p3, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s38 1) (GEQ s45 1)), p0:(GEQ s19 1), p1:(AND (GEQ s5 1) (GEQ s27 1) (GEQ s31 1)), p3:(AND (GEQ s33 1) (GEQ s50 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]]
Product exploration explored 100000 steps with 46123 reset in 153 ms.
Product exploration explored 100000 steps with 46166 reset in 163 ms.
Computed a total of 60 stabilizing places and 311 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 311
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 p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3)))]
Property proved to be true thanks to knowledge :(F (G (NOT p3)))
Knowledge based reduction with 11 factoid took 442 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S16C2-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLFireability-15 finished in 1219 ms.
All properties solved by simple procedures.
Total runtime 11470 ms.
ITS solved all properties within timeout

BK_STOP 1679458777775

--------------------
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-S16C2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is LeafsetExtension-PT-S16C2, 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 r231-tall-167856416100476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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