Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716314520188

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:02:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 18:02:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:02:01] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 18:02:01] [INFO ] Transformed 300 places.
[2024-05-21 18:02:01] [INFO ] Transformed 251 transitions.
[2024-05-21 18:02:01] [INFO ] Found NUPN structural information;
[2024-05-21 18:02:01] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-05b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 275 transition count 229
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 275 transition count 229
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 262 transition count 216
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 262 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 84 place count 262 transition count 205
Applied a total of 84 rules in 74 ms. Remains 262 /300 variables (removed 38) and now considering 205/251 (removed 46) transitions.
// Phase 1: matrix 205 rows 262 cols
[2024-05-21 18:02:01] [INFO ] Computed 62 invariants in 22 ms
[2024-05-21 18:02:02] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-21 18:02:02] [INFO ] Invariant cache hit.
[2024-05-21 18:02:02] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 599 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/300 places, 205/251 transitions.
Applied a total of 0 rules in 6 ms. Remains 261 /261 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 696 ms. Remains : 261/300 places, 205/251 transitions.
Support contains 38 out of 261 places after structural reductions.
[2024-05-21 18:02:02] [INFO ] Flatten gal took : 44 ms
[2024-05-21 18:02:02] [INFO ] Flatten gal took : 25 ms
[2024-05-21 18:02:02] [INFO ] Input system was already deterministic with 205 transitions.
RANDOM walk for 40000 steps (343 resets) in 1637 ms. (24 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40003 steps (56 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
// Phase 1: matrix 205 rows 261 cols
[2024-05-21 18:02:03] [INFO ] Computed 61 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 18:02:03] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 16 ms to minimize.
[2024-05-21 18:02:03] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 68/233 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/245 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 192/437 variables, 245/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/456 variables, 11/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/462 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/464 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/464 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/466 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/466 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/466 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/233 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/245 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 192/437 variables, 245/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/456 variables, 11/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/462 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/464 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/466 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/466 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/466 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 637ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 128 ms.
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 256 transition count 184
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 240 transition count 184
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 240 transition count 173
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 229 transition count 173
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 224 transition count 168
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 224 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 224 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 68 place count 224 transition count 165
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 72 place count 222 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 221 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 221 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 221 transition count 162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 220 transition count 161
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 232 place count 143 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 236 place count 141 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 141 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 140 transition count 85
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 140 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 139 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 241 place count 138 transition count 84
Applied a total of 241 rules in 79 ms. Remains 138 /261 variables (removed 123) and now considering 84/205 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 138/261 places, 84/205 transitions.
RANDOM walk for 40000 steps (1920 resets) in 1112 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (385 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1869174 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :0 out of 1
Probabilistic random walk after 1869174 steps, saw 267441 distinct states, run finished after 3004 ms. (steps per millisecond=622 ) properties seen :0
// Phase 1: matrix 84 rows 138 cols
[2024-05-21 18:02:07] [INFO ] Computed 60 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/54 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/89 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/114 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/121 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/196 variables, 121/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/209 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/211 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/218 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/222 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/222 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/222 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/89 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/114 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/121 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/196 variables, 121/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/209 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/211 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/211 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 7/218 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/218 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/222 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/222 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/222 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 413ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 138/138 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 84/84 transitions.
Applied a total of 0 rules in 7 ms. Remains 138 /138 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-21 18:02:07] [INFO ] Invariant cache hit.
[2024-05-21 18:02:08] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 18:02:08] [INFO ] Invariant cache hit.
[2024-05-21 18:02:08] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-21 18:02:08] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-21 18:02:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 84/221 variables, 137/197 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/222 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-21 18:02:09] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-21 18:02:10] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:02:10] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-21 18:02:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 202 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3123 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 2/137 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 84/221 variables, 137/201 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 81/282 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 1/222 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-21 18:02:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:02:16] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/222 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 285 constraints, problems are : Problem set: 0 solved, 81 unsolved in 11636 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 6/6 constraints]
After SMT, in 14797ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 14801ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15030 ms. Remains : 138/138 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 138 transition count 84
Applied a total of 1 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 138 cols
[2024-05-21 18:02:22] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 18:02:22] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 18:02:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 18:02:23] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:02:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 18:02:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 18:02:23] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 18:02:23] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 18:02:23] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 271 ms.
Computed a total of 78 stabilizing places and 71 stable transitions
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 255 transition count 188
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 242 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 187
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 29 place count 241 transition count 176
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 230 transition count 176
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 56 place count 225 transition count 171
Iterating global reduction 3 with 5 rules applied. Total rules applied 61 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 225 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 225 transition count 168
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 223 transition count 168
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 222 transition count 167
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 222 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 221 transition count 164
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 224 place count 145 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 228 place count 143 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 141 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 140 transition count 88
Applied a total of 231 rules in 46 ms. Remains 140 /261 variables (removed 121) and now considering 88/205 (removed 117) transitions.
// Phase 1: matrix 88 rows 140 cols
[2024-05-21 18:02:23] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 18:02:23] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 18:02:23] [INFO ] Invariant cache hit.
[2024-05-21 18:02:23] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-21 18:02:23] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-21 18:02:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 2/139 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:24] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 88/227 variables, 139/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:25] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:02:25] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-21 18:02:25] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:02:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 203 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3295 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 2/139 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 88/227 variables, 139/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 84/286 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:29] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 288 constraints, problems are : Problem set: 0 solved, 84 unsolved in 9961 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
After SMT, in 13284ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 13286ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/261 places, 88/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13572 ms. Remains : 140/261 places, 88/205 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-00
Product exploration explored 100000 steps with 5061 reset in 323 ms.
Product exploration explored 100000 steps with 5034 reset in 272 ms.
Computed a total of 35 stabilizing places and 30 stable transitions
Computed a total of 35 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 16036 steps (800 resets) in 74 ms. (213 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-21 18:02:38] [INFO ] Invariant cache hit.
[2024-05-21 18:02:38] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 18:02:38] [INFO ] Invariant cache hit.
[2024-05-21 18:02:38] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-21 18:02:38] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-21 18:02:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 2/139 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:39] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 88/227 variables, 139/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:40] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:02:40] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-21 18:02:40] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:02:40] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 203 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3299 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 2/139 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 88/227 variables, 139/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 84/286 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:44] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 288 constraints, problems are : Problem set: 0 solved, 84 unsolved in 9550 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
After SMT, in 12866ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 12868ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13129 ms. Remains : 140/140 places, 88/88 transitions.
Computed a total of 35 stabilizing places and 30 stable transitions
Computed a total of 35 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 21506 steps (1099 resets) in 74 ms. (286 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4982 reset in 192 ms.
Product exploration explored 100000 steps with 5017 reset in 277 ms.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-21 18:02:52] [INFO ] Invariant cache hit.
[2024-05-21 18:02:52] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 18:02:52] [INFO ] Invariant cache hit.
[2024-05-21 18:02:52] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 18:02:52] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-21 18:02:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 2/139 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:53] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 88/227 variables, 139/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:02:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-21 18:02:54] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:02:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 203 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3330 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 2/139 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 88/227 variables, 139/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 84/286 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:02:58] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 288 constraints, problems are : Problem set: 0 solved, 84 unsolved in 10080 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
After SMT, in 13430ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 13431ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13648 ms. Remains : 140/140 places, 88/88 transitions.
Treatment of property DES-PT-05b-LTLFireability-00 finished in 42413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 255 transition count 189
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 243 transition count 189
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 243 transition count 176
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 51 place count 230 transition count 176
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 225 transition count 171
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 225 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 62 place count 225 transition count 168
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 223 transition count 168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 222 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 222 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 221 transition count 164
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 224 place count 145 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 228 place count 143 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 141 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 140 transition count 88
Applied a total of 231 rules in 33 ms. Remains 140 /261 variables (removed 121) and now considering 88/205 (removed 117) transitions.
// Phase 1: matrix 88 rows 140 cols
[2024-05-21 18:03:05] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 18:03:06] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 18:03:06] [INFO ] Invariant cache hit.
[2024-05-21 18:03:06] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 18:03:06] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-21 18:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 2/139 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 88/227 variables, 139/197 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:07] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/228 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:08] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:08] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/228 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 201 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3664 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 2/139 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 88/227 variables, 139/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 85/285 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:11] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:13] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 288 constraints, problems are : Problem set: 0 solved, 85 unsolved in 12052 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
After SMT, in 15731ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 15732ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/261 places, 88/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16065 ms. Remains : 140/261 places, 88/205 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-01
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-01 finished in 16190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 255 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 241 transition count 187
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 241 transition count 175
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 229 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 224 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 224 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 224 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 224 transition count 167
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 68 place count 222 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 221 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 221 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 221 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 220 transition count 163
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 222 place count 146 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 226 place count 144 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 142 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 229 place count 141 transition count 89
Applied a total of 229 rules in 32 ms. Remains 141 /261 variables (removed 120) and now considering 89/205 (removed 116) transitions.
// Phase 1: matrix 89 rows 141 cols
[2024-05-21 18:03:22] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 18:03:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 18:03:22] [INFO ] Invariant cache hit.
[2024-05-21 18:03:22] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 18:03:22] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-21 18:03:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 2/140 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 89/229 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:23] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:24] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:03:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:03:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 1/230 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/230 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 203 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3602 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 1/138 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 2/140 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 89/229 variables, 140/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 85/287 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:27] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:03:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:29] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:31] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/229 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (OVERLAPS) 1/230 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-21 18:03:41] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/230 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/230 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (OVERLAPS) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 297 constraints, problems are : Problem set: 0 solved, 85 unsolved in 28713 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 13/13 constraints]
After SMT, in 32336ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 32337ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/261 places, 89/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32571 ms. Remains : 141/261 places, 89/205 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-02
Product exploration explored 100000 steps with 5331 reset in 228 ms.
Product exploration explored 100000 steps with 5317 reset in 247 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 693 steps (30 resets) in 7 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 89/89 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-05-21 18:03:55] [INFO ] Invariant cache hit.
[2024-05-21 18:03:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 18:03:55] [INFO ] Invariant cache hit.
[2024-05-21 18:03:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-21 18:03:55] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-21 18:03:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 2/140 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 89/229 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:03:57] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:03:57] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:03:58] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 1/230 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/230 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 203 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3676 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 1/138 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 2/140 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 89/229 variables, 140/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 85/287 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-21 18:04:01] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:03] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:05] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/229 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:07] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (OVERLAPS) 1/230 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:04:15] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/230 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:17] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 5 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/230 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (OVERLAPS) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 297 constraints, problems are : Problem set: 0 solved, 85 unsolved in 29099 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 13/13 constraints]
After SMT, in 32792ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 32793ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33006 ms. Remains : 141/141 places, 89/89 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1746 steps (91 resets) in 10 ms. (158 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5323 reset in 187 ms.
Product exploration explored 100000 steps with 5311 reset in 204 ms.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 89/89 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-05-21 18:04:29] [INFO ] Invariant cache hit.
[2024-05-21 18:04:29] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 18:04:29] [INFO ] Invariant cache hit.
[2024-05-21 18:04:29] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-21 18:04:29] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-21 18:04:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 2/140 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 89/229 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:04:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:04:31] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 1/230 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/230 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 203 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3597 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 1/138 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 2/140 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 89/229 variables, 140/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 85/287 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-21 18:04:35] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:36] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:39] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/229 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:41] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (OVERLAPS) 1/230 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 18:04:49] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/230 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:04:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/230 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (OVERLAPS) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 297 constraints, problems are : Problem set: 0 solved, 85 unsolved in 28666 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 13/13 constraints]
After SMT, in 32292ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 32293ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32516 ms. Remains : 141/141 places, 89/89 transitions.
Treatment of property DES-PT-05b-LTLFireability-02 finished in 99979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (X(p1) U (p2 U G(!p2)))))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 257 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 256 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 256 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 255 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 255 transition count 196
Applied a total of 15 rules in 13 ms. Remains 255 /261 variables (removed 6) and now considering 196/205 (removed 9) transitions.
// Phase 1: matrix 196 rows 255 cols
[2024-05-21 18:05:02] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 18:05:02] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 18:05:02] [INFO ] Invariant cache hit.
[2024-05-21 18:05:02] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-21 18:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/451 variables, 255/316 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:05] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:05:05] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:05:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:05:06] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:08] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-21 18:05:08] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:05:08] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:05:08] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:05:08] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:05:08] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:05:08] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 7/327 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:09] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-21 18:05:09] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 18:05:09] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 2 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:05:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 13/340 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-21 18:05:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:05:13] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-21 18:05:13] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:05:13] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:05:13] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:05:13] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 15/355 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:17] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:05:17] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/451 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (OVERLAPS) 0/451 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 357 constraints, problems are : Problem set: 0 solved, 195 unsolved in 19541 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 41/102 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:23] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 18:05:23] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 18:05:23] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:05:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:05:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-21 18:05:23] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-21 18:05:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:05:24] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:24] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-21 18:05:24] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:05:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:05:24] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:05:25] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 17/127 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:26] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:27] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:05:27] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:29] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-21 18:05:29] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:31] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:05:31] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:05:32] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-21 18:05:32] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-21 18:05:32] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:05:32] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:05:32] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:34] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:05:34] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:36] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (OVERLAPS) 196/451 variables, 255/397 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 195/592 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 18:05:50] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 593 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 82/82 constraints]
After SMT, in 49580ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 49583ms
Starting structural reductions in LTL mode, iteration 1 : 255/261 places, 196/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49922 ms. Remains : 255/261 places, 196/205 transitions.
Stuttering acceptance computed with spot in 229 ms :[p2, (AND p0 p2 (NOT p1)), (AND p2 (NOT p1) p0), p0, (AND p0 p2 p1), (AND p0 p2)]
Running random walk in product with property : DES-PT-05b-LTLFireability-03
Product exploration explored 100000 steps with 33185 reset in 109 ms.
Product exploration explored 100000 steps with 33334 reset in 102 ms.
Computed a total of 77 stabilizing places and 70 stable transitions
Graph (complete) has 469 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 77 stabilizing places and 70 stable transitions
Detected a total of 77/255 stabilizing places and 70/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 160 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (345 resets) in 630 ms. (63 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (61 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (69 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
[2024-05-21 18:05:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 138/167 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 59/226 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:05:53] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:05:53] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:05:53] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:05:53] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:05:53] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/239 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 183/422 variables, 239/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/441 variables, 11/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/447 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/449 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/451 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/451 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/451 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 321 constraints, problems are : Problem set: 0 solved, 2 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:05:53] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 138/167 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 59/226 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:05:53] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/239 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 183/422 variables, 239/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 19/441 variables, 11/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/441 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:05:54] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 18:05:54] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:05:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:05:54] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-21 18:05:54] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/441 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/447 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:05:54] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/449 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/449 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/451 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/451 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/451 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 331 constraints, problems are : Problem set: 0 solved, 2 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 1275ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 108 ms.
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 196/196 transitions.
Graph (complete) has 469 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 250 transition count 175
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 234 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 233 transition count 174
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 37 place count 233 transition count 164
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 223 transition count 164
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 213 place count 145 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 217 place count 143 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 143 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 142 transition count 87
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 142 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 141 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 140 transition count 86
Applied a total of 222 rules in 19 ms. Remains 140 /255 variables (removed 115) and now considering 86/196 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 140/255 places, 86/196 transitions.
RANDOM walk for 33704 steps (1419 resets) in 97 ms. (343 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0) p1))), (F p0), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 16 factoid took 421 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 175 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 196/196 transitions.
Graph (complete) has 469 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 249 transition count 178
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 235 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 234 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 234 transition count 167
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 224 transition count 167
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 207 place count 146 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 144 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 142 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 141 transition count 89
Applied a total of 214 rules in 22 ms. Remains 141 /255 variables (removed 114) and now considering 89/196 (removed 107) transitions.
// Phase 1: matrix 89 rows 141 cols
[2024-05-21 18:05:55] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 18:05:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 18:05:55] [INFO ] Invariant cache hit.
[2024-05-21 18:05:55] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 18:05:55] [INFO ] Redundant transitions in 3 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-21 18:05:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/140 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 89/229 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:05:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:05:57] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:05:57] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:05:57] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:05:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:05:57] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 205 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2877 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 2/140 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 89/229 variables, 140/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 86/290 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 1/230 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:06:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/230 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 292 constraints, problems are : Problem set: 0 solved, 86 unsolved in 11398 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints]
After SMT, in 14293ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 14294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/255 places, 89/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14539 ms. Remains : 141/255 places, 89/196 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/141 stabilizing places and 31/89 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 14 factoid took 362 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (1975 resets) in 207 ms. (192 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (379 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
[2024-05-21 18:06:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/116 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 9/125 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 80/205 variables, 125/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/217 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/225 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/230 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/230 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/116 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/125 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 80/205 variables, 125/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/217 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/225 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/225 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/230 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/230 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 89/89 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 141 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 141 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 140 transition count 87
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 140 transition count 87
Applied a total of 4 rules in 9 ms. Remains 140 /141 variables (removed 1) and now considering 87/89 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 140/141 places, 87/89 transitions.
RANDOM walk for 40000 steps (1871 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (349 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1967391 steps, run timeout after 3001 ms. (steps per millisecond=655 ) properties seen :0 out of 1
Probabilistic random walk after 1967391 steps, saw 267190 distinct states, run finished after 3001 ms. (steps per millisecond=655 ) properties seen :0
// Phase 1: matrix 87 rows 140 cols
[2024-05-21 18:06:14] [INFO ] Computed 59 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 31/47 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/84 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/116 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/125 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 78/203 variables, 125/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/215 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/223 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/223 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/223 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/227 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/227 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/227 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/47 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/84 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 18:06:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/116 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 18:06:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/125 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 78/203 variables, 125/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/215 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/215 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/215 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/223 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/223 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/223 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/227 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/227 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/227 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 285ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 87/87 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 140/140 places, 87/87 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-21 18:06:14] [INFO ] Invariant cache hit.
[2024-05-21 18:06:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 18:06:14] [INFO ] Invariant cache hit.
[2024-05-21 18:06:14] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-21 18:06:14] [INFO ] Redundant transitions in 0 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-21 18:06:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 2/139 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 87/226 variables, 139/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:06:15] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:06:15] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-21 18:06:15] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-21 18:06:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:06:16] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/227 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:06:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:06:17] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 0/227 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 206 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3964 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 2/139 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:06:19] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 87/226 variables, 139/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 84/290 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 1/227 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 0/227 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 291 constraints, problems are : Problem set: 0 solved, 84 unsolved in 8706 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints]
After SMT, in 12690ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 12691ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12893 ms. Remains : 140/140 places, 87/87 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 87
Applied a total of 1 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 140 cols
[2024-05-21 18:06:27] [INFO ] Computed 59 invariants in 4 ms
[2024-05-21 18:06:27] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 18:06:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 18:06:27] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:06:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 18:06:27] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 18:06:27] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 18:06:27] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 18:06:27] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p0), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 660 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 219 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 239 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 28218 reset in 216 ms.
Product exploration explored 100000 steps with 28265 reset in 219 ms.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 89/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 141 /141 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 141 cols
[2024-05-21 18:06:29] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 18:06:29] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 18:06:29] [INFO ] Invariant cache hit.
[2024-05-21 18:06:29] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-21 18:06:29] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-21 18:06:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/140 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 89/229 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:06:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-21 18:06:30] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:06:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:06:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:06:31] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:06:31] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 205 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2862 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 2/140 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 89/229 variables, 140/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 86/290 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 1/230 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:06:36] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/230 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 292 constraints, problems are : Problem set: 0 solved, 86 unsolved in 11343 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints]
After SMT, in 14221ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 14223ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14455 ms. Remains : 141/141 places, 89/89 transitions.
Treatment of property DES-PT-05b-LTLFireability-03 finished in 101663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 254 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 253 transition count 194
Applied a total of 19 rules in 8 ms. Remains 253 /261 variables (removed 8) and now considering 194/205 (removed 11) transitions.
// Phase 1: matrix 194 rows 253 cols
[2024-05-21 18:06:43] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 18:06:43] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 18:06:43] [INFO ] Invariant cache hit.
[2024-05-21 18:06:44] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-21 18:06:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:06:47] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:06:47] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:06:47] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 18:06:47] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:06:48] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:06:50] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:06:50] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:06:50] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:06:50] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:06:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:06:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:06:53] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 19/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14003 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:06:59] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-21 18:07:00] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
[2024-05-21 18:07:00] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 18:07:00] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:07:00] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:07:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:07:00] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-21 18:07:00] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:07:00] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:07:01] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:07:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:07:02] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-21 18:07:03] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 194/447 variables, 253/368 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 193/561 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:07:07] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-21 18:07:07] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:07:08] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:07:10] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-21 18:07:12] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:07:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:07:19] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-21 18:07:20] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:07:21] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 2 ms to minimize.
[2024-05-21 18:07:23] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 571 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 64/64 constraints]
After SMT, in 44043ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 44047ms
Starting structural reductions in LTL mode, iteration 1 : 253/261 places, 194/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44357 ms. Remains : 253/261 places, 194/205 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5239 steps with 44 reset in 16 ms.
FORMULA DES-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-04 finished in 44595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 255 transition count 188
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 242 transition count 188
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 242 transition count 175
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 229 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 224 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 224 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 224 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 224 transition count 167
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 68 place count 222 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 221 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 221 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 221 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 220 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 220 place count 147 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 143 transition count 90
Applied a total of 226 rules in 31 ms. Remains 143 /261 variables (removed 118) and now considering 90/205 (removed 115) transitions.
// Phase 1: matrix 90 rows 143 cols
[2024-05-21 18:07:28] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 18:07:28] [INFO ] Implicit Places using invariants in 89 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/261 places, 90/205 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 142/261 places, 90/205 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-05b-LTLFireability-05
Product exploration explored 100000 steps with 5733 reset in 257 ms.
Product exploration explored 100000 steps with 5815 reset in 264 ms.
Computed a total of 38 stabilizing places and 33 stable transitions
Computed a total of 38 stabilizing places and 33 stable transitions
Detected a total of 38/142 stabilizing places and 33/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 490 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 75 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 570 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 142 cols
[2024-05-21 18:07:30] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 18:07:30] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 18:07:30] [INFO ] Invariant cache hit.
[2024-05-21 18:07:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 18:07:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-21 18:07:30] [INFO ] Redundant transitions in 0 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-21 18:07:30] [INFO ] Invariant cache hit.
[2024-05-21 18:07:30] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/142 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 90/232 variables, 142/200 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 206 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/142 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 90/232 variables, 142/200 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 87/293 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:07:34] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-21 18:07:35] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:07:36] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
[2024-05-21 18:07:36] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-21 18:07:37] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:07:37] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:07:37] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-21 18:07:38] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:07:38] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-21 18:07:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:07:41] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/232 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:07:44] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:07:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:07:48] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 19 (OVERLAPS) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 307 constraints, problems are : Problem set: 0 solved, 87 unsolved in 22599 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 14/14 constraints]
After SMT, in 24675ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 24676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24915 ms. Remains : 142/142 places, 90/90 transitions.
Computed a total of 38 stabilizing places and 33 stable transitions
Computed a total of 38 stabilizing places and 33 stable transitions
Detected a total of 38/142 stabilizing places and 33/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 505 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 32 steps (1 resets) in 4 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 572 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5819 reset in 208 ms.
Product exploration explored 100000 steps with 5867 reset in 219 ms.
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-21 18:07:57] [INFO ] Invariant cache hit.
[2024-05-21 18:07:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 18:07:57] [INFO ] Invariant cache hit.
[2024-05-21 18:07:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 18:07:57] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-21 18:07:57] [INFO ] Redundant transitions in 0 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-21 18:07:57] [INFO ] Invariant cache hit.
[2024-05-21 18:07:57] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/142 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 90/232 variables, 142/200 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 206 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2073 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/142 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 90/232 variables, 142/200 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 87/293 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:08:01] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-21 18:08:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:08:03] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:08:03] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:08:04] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:08:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-21 18:08:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-21 18:08:04] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:08:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:08:04] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:08:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/232 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:08:11] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:08:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:08:15] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 19 (OVERLAPS) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 307 constraints, problems are : Problem set: 0 solved, 87 unsolved in 22555 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 14/14 constraints]
After SMT, in 24643ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 24644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24884 ms. Remains : 142/142 places, 90/90 transitions.
Treatment of property DES-PT-05b-LTLFireability-05 finished in 53690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 254 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 253 transition count 194
Applied a total of 19 rules in 15 ms. Remains 253 /261 variables (removed 8) and now considering 194/205 (removed 11) transitions.
// Phase 1: matrix 194 rows 253 cols
[2024-05-21 18:08:22] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 18:08:22] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 18:08:22] [INFO ] Invariant cache hit.
[2024-05-21 18:08:22] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-21 18:08:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:25] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:08:25] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-21 18:08:25] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:08:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:08:26] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:28] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:08:28] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-05-21 18:08:28] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:29] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:08:30] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:30] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:08:30] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:08:30] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:08:32] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 18:08:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 19/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14153 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:37] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 18:08:37] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:08:37] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:08:37] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:39] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:08:39] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:41] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:08:41] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 194/447 variables, 253/368 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 193/561 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:46] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-21 18:08:46] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-21 18:08:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:08:48] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:08:51] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:08:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:08:58] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 18:08:59] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:08:59] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-21 18:09:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 571 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 64/64 constraints]
After SMT, in 44193ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 44199ms
Starting structural reductions in LTL mode, iteration 1 : 253/261 places, 194/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44545 ms. Remains : 253/261 places, 194/205 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2945 steps with 24 reset in 10 ms.
FORMULA DES-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-07 finished in 44643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 255 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 241 transition count 187
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 241 transition count 177
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 231 transition count 177
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 226 transition count 172
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 226 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 226 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 226 transition count 169
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 64 place count 224 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 223 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 223 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 223 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 222 transition count 165
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 218 place count 148 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 146 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 144 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 143 transition count 91
Applied a total of 225 rules in 27 ms. Remains 143 /261 variables (removed 118) and now considering 91/205 (removed 114) transitions.
// Phase 1: matrix 91 rows 143 cols
[2024-05-21 18:09:06] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 18:09:06] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 18:09:06] [INFO ] Invariant cache hit.
[2024-05-21 18:09:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-21 18:09:06] [INFO ] Redundant transitions in 0 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-21 18:09:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/140 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:07] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 2/142 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 91/233 variables, 142/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 1/234 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:09] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:09:09] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:09:09] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:09:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-21 18:09:09] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:10] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:10] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/234 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 17 (OVERLAPS) 0/234 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 209 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5054 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 2/140 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 2/142 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 91/233 variables, 142/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 86/294 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (OVERLAPS) 1/234 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:19] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:09:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/234 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/234 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:09:24] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/234 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 20 (OVERLAPS) 0/234 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 299 constraints, problems are : Problem set: 0 solved, 86 unsolved in 20181 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 12/12 constraints]
After SMT, in 25251ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 25252ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/261 places, 91/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25523 ms. Remains : 143/261 places, 91/205 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : DES-PT-05b-LTLFireability-08
Product exploration explored 100000 steps with 4673 reset in 198 ms.
Product exploration explored 100000 steps with 4656 reset in 212 ms.
Computed a total of 37 stabilizing places and 32 stable transitions
Computed a total of 37 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 418 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 796 steps (29 resets) in 11 ms. (66 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 692 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-21 18:09:34] [INFO ] Invariant cache hit.
[2024-05-21 18:09:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 18:09:34] [INFO ] Invariant cache hit.
[2024-05-21 18:09:34] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 18:09:34] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-21 18:09:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/140 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 2/142 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 91/233 variables, 142/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 1/234 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:36] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:09:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:09:36] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:09:36] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-21 18:09:36] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:37] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/234 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 17 (OVERLAPS) 0/234 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 209 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 2/140 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 2/142 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 91/233 variables, 142/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 86/294 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (OVERLAPS) 1/234 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-21 18:09:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/234 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/234 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:09:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-21 18:09:51] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/234 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 20 (OVERLAPS) 0/234 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 299 constraints, problems are : Problem set: 0 solved, 86 unsolved in 20098 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 12/12 constraints]
After SMT, in 25158ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 25159ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25387 ms. Remains : 143/143 places, 91/91 transitions.
Computed a total of 37 stabilizing places and 32 stable transitions
Computed a total of 37 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 404 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 487 steps (19 resets) in 9 ms. (48 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 783 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Product exploration explored 100000 steps with 4641 reset in 221 ms.
Product exploration explored 100000 steps with 4655 reset in 241 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-21 18:10:01] [INFO ] Invariant cache hit.
[2024-05-21 18:10:01] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 18:10:01] [INFO ] Invariant cache hit.
[2024-05-21 18:10:01] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-21 18:10:01] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-21 18:10:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/140 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:10:02] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 2/142 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 91/233 variables, 142/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 1/234 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:10:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-21 18:10:04] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-21 18:10:04] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-21 18:10:04] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:10:04] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:10:05] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:10:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/234 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 17 (OVERLAPS) 0/234 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 209 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5156 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 2/140 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 2/142 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 91/233 variables, 142/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 86/294 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (OVERLAPS) 1/234 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:10:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:10:15] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/234 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/234 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-21 18:10:19] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:10:19] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/234 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 20 (OVERLAPS) 0/234 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 299 constraints, problems are : Problem set: 0 solved, 86 unsolved in 20207 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 12/12 constraints]
After SMT, in 25385ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 25387ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25617 ms. Remains : 143/143 places, 91/91 transitions.
Treatment of property DES-PT-05b-LTLFireability-08 finished in 80487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 255 transition count 188
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 242 transition count 188
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 242 transition count 176
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 230 transition count 176
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 225 transition count 171
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 225 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 225 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 224 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 223 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 223 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 223 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 222 transition count 165
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 224 place count 145 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 228 place count 143 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 141 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 140 transition count 88
Applied a total of 231 rules in 23 ms. Remains 140 /261 variables (removed 121) and now considering 88/205 (removed 117) transitions.
// Phase 1: matrix 88 rows 140 cols
[2024-05-21 18:10:27] [INFO ] Computed 58 invariants in 9 ms
[2024-05-21 18:10:27] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 18:10:27] [INFO ] Invariant cache hit.
[2024-05-21 18:10:27] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-21 18:10:27] [INFO ] Redundant transitions in 0 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-21 18:10:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 2/139 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 88/227 variables, 139/197 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/228 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:10:29] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:10:29] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 18:10:30] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/228 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 201 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4213 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 2/139 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 88/227 variables, 139/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 85/285 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 1/228 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 286 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8965 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints]
After SMT, in 13196ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 13197ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/261 places, 88/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13443 ms. Remains : 140/261 places, 88/205 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-10
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-10 finished in 13501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U (X(p2)&&p1))||X(p3)))||G(p4)))'
Support contains 11 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 257 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 256 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 256 transition count 199
Applied a total of 11 rules in 11 ms. Remains 256 /261 variables (removed 5) and now considering 199/205 (removed 6) transitions.
// Phase 1: matrix 199 rows 256 cols
[2024-05-21 18:10:40] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 18:10:40] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 18:10:40] [INFO ] Invariant cache hit.
[2024-05-21 18:10:41] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 18:10:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/455 variables, 256/317 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:10:44] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-21 18:10:44] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:10:46] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:10:46] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:10:47] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:10:48] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:10:48] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:10:48] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:10:49] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:10:50] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:10:50] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 12/336 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:10:52] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:10:52] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:10:52] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-21 18:10:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:10:54] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:10:54] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:10:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:10:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:10:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/455 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:10:57] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:10:57] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:10:57] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:10:58] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:10:58] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:10:58] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-21 18:10:58] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 7/352 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:10:59] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/455 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/455 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 16 (OVERLAPS) 0/455 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 353 constraints, problems are : Problem set: 0 solved, 198 unsolved in 23419 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 36/97 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:11:05] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:11:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:11:05] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:11:05] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:11:05] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:11:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-21 18:11:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:11:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:11:06] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-05-21 18:11:06] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:11:06] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-21 18:11:06] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:11:07] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:11:07] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:11:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:11:07] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 18:11:07] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-21 18:11:07] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-21 18:11:07] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:11:08] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 18:11:08] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:11:09] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-21 18:11:09] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 18:11:09] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-21 18:11:09] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:11:10] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:11:11] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:11:11] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:11:11] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:11:11] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-21 18:11:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 199/455 variables, 256/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 198/592 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:11:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:11:14] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-21 18:11:14] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-21 18:11:15] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-21 18:11:18] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:11:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:11:18] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-21 18:11:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 8/600 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 18:11:30] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-21 18:11:30] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-21 18:11:30] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 603 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 88/88 constraints]
After SMT, in 53460ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 53463ms
Starting structural reductions in LTL mode, iteration 1 : 256/261 places, 199/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53782 ms. Remains : 256/261 places, 199/205 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4))]
Running random walk in product with property : DES-PT-05b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 77 stabilizing places and 70 stable transitions
Graph (complete) has 473 edges and 256 vertex of which 251 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 77 stabilizing places and 70 stable transitions
Detected a total of 77/256 stabilizing places and 70/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) p4), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3)))), (X p4), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p4 (NOT p3)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 p4 (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p4 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p4 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p4) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3))))), (X (X p4)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 p4 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p4) (G (NOT p4))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 34 factoid took 21 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-05b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-05b-LTLFireability-11 finished in 54324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 255 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 241 transition count 187
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 241 transition count 175
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 229 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 227 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 227 transition count 173
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 211 place count 150 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 150 transition count 95
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 218 place count 147 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 220 place count 145 transition count 108
Applied a total of 220 rules in 30 ms. Remains 145 /261 variables (removed 116) and now considering 108/205 (removed 97) transitions.
// Phase 1: matrix 108 rows 145 cols
[2024-05-21 18:11:35] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 18:11:35] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 18:11:35] [INFO ] Invariant cache hit.
[2024-05-21 18:11:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 18:11:35] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-21 18:11:35] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-21 18:11:35] [INFO ] Invariant cache hit.
[2024-05-21 18:11:35] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 3/144 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 108/252 variables, 144/203 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 12/215 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/253 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 18:11:37] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:11:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/253 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/253 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 218 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4365 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 145/145 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 3/144 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 18:11:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 108/252 variables, 144/206 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 12/218 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 104/322 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 1/253 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 18:11:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:11:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 18:11:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 15 (OVERLAPS) 0/253 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 326 constraints, problems are : Problem set: 0 solved, 104 unsolved in 15868 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 145/145 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 6/6 constraints]
After SMT, in 20267ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 20269ms
Starting structural reductions in SI_LTL mode, iteration 1 : 145/261 places, 108/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20563 ms. Remains : 145/261 places, 108/205 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-12
Stuttering criterion allowed to conclude after 27 steps with 1 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-12 finished in 20719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 254 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 253 transition count 194
Applied a total of 19 rules in 32 ms. Remains 253 /261 variables (removed 8) and now considering 194/205 (removed 11) transitions.
// Phase 1: matrix 194 rows 253 cols
[2024-05-21 18:11:55] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 18:11:55] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 18:11:55] [INFO ] Invariant cache hit.
[2024-05-21 18:11:56] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-21 18:11:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:11:59] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:11:59] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-21 18:11:59] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:11:59] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:12:00] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:02] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:12:02] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:12:02] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:02] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:12:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:04] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:12:04] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:12:04] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:12:04] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:12:04] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:12:04] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:12:04] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:12:04] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-21 18:12:05] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:12:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 19/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14230 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 15 ms to minimize.
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-21 18:12:11] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:12:12] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:13] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:12:13] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:14] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:14] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-21 18:12:15] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 194/447 variables, 253/368 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 193/561 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:20] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-21 18:12:20] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-05-21 18:12:20] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:12:22] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 18:12:25] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:12:25] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:32] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:12:33] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:12:33] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:12:36] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 571 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 64/64 constraints]
After SMT, in 44267ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 44272ms
Starting structural reductions in LTL mode, iteration 1 : 253/261 places, 194/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44632 ms. Remains : 253/261 places, 194/205 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DES-PT-05b-LTLFireability-14
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-14 finished in 44760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 254 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 253 transition count 194
Applied a total of 19 rules in 21 ms. Remains 253 /261 variables (removed 8) and now considering 194/205 (removed 11) transitions.
[2024-05-21 18:12:40] [INFO ] Invariant cache hit.
[2024-05-21 18:12:40] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 18:12:40] [INFO ] Invariant cache hit.
[2024-05-21 18:12:40] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-21 18:12:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:43] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:12:44] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 18:12:44] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-21 18:12:44] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:12:45] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:46] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:12:46] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:12:46] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:12:48] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:12:49] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:12:50] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:12:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:12:50] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-21 18:12:50] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 19/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 13840 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:55] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:12:55] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:12:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:12:56] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 18:12:57] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:57] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-21 18:12:57] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:12:59] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-21 18:12:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 194/447 variables, 253/368 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 193/561 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:13:04] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-21 18:13:04] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-21 18:13:04] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:13:07] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-21 18:13:09] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:13:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 18:13:16] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:13:18] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:13:18] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:13:20] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 571 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 64/64 constraints]
After SMT, in 43875ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 43877ms
Starting structural reductions in LTL mode, iteration 1 : 253/261 places, 194/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44225 ms. Remains : 253/261 places, 194/205 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-15
Product exploration explored 100000 steps with 882 reset in 179 ms.
Product exploration explored 100000 steps with 875 reset in 190 ms.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Detected a total of 76/253 stabilizing places and 69/194 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 248 steps (0 resets) in 5 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 1 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 247 transition count 175
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 232 transition count 175
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 232 transition count 163
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 220 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 201 place count 147 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 143 transition count 90
Applied a total of 207 rules in 22 ms. Remains 143 /253 variables (removed 110) and now considering 90/194 (removed 104) transitions.
// Phase 1: matrix 90 rows 143 cols
[2024-05-21 18:13:25] [INFO ] Computed 59 invariants in 0 ms
[2024-05-21 18:13:25] [INFO ] Implicit Places using invariants in 101 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/253 places, 90/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 142/253 places, 90/194 transitions.
Computed a total of 39 stabilizing places and 34 stable transitions
Computed a total of 39 stabilizing places and 34 stable transitions
Detected a total of 39/142 stabilizing places and 34/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4495 reset in 203 ms.
Product exploration explored 100000 steps with 4521 reset in 226 ms.
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 88
Applied a total of 1 rules in 4 ms. Remains 140 /142 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 140 cols
[2024-05-21 18:13:26] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 18:13:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 18:13:26] [INFO ] Invariant cache hit.
[2024-05-21 18:13:26] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-21 18:13:26] [INFO ] Redundant transitions in 0 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-21 18:13:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:13:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:13:27] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:13:28] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:13:28] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-21 18:13:28] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
[2024-05-21 18:13:28] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 2/139 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 88/227 variables, 139/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:13:29] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:13:29] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 1/228 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-21 18:13:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:13:30] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 16 (OVERLAPS) 0/228 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 208 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4589 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 2/139 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 88/227 variables, 139/207 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 84/291 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 292 constraints, problems are : Problem set: 0 solved, 84 unsolved in 8760 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 10/10 constraints]
After SMT, in 13365ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 13367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/142 places, 88/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13603 ms. Remains : 140/142 places, 88/90 transitions.
Treatment of property DES-PT-05b-LTLFireability-15 finished in 59850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (X(p1) U (p2 U G(!p2)))))'
Found a Lengthening insensitive property : DES-PT-05b-LTLFireability-03
Stuttering acceptance computed with spot in 257 ms :[p2, (AND p0 p2 (NOT p1)), (AND p2 (NOT p1) p0), p0, (AND p0 p2 p1), (AND p0 p2)]
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 255 transition count 189
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 242 transition count 188
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 27 place count 242 transition count 177
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 49 place count 231 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 228 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 228 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 228 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 227 transition count 172
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 226 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 226 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 62 place count 226 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 64 place count 225 transition count 168
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 7 with 154 rules applied. Total rules applied 218 place count 148 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 224 place count 145 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 226 place count 143 transition count 97
Applied a total of 226 rules in 26 ms. Remains 143 /261 variables (removed 118) and now considering 97/205 (removed 108) transitions.
// Phase 1: matrix 97 rows 143 cols
[2024-05-21 18:13:41] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 18:13:41] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 18:13:41] [INFO ] Invariant cache hit.
[2024-05-21 18:13:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 18:13:41] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-21 18:13:41] [INFO ] Invariant cache hit.
[2024-05-21 18:13:41] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/142 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 97/239 variables, 142/201 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/240 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:13:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:13:44] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/240 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 212 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3863 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/142 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 97/239 variables, 142/203 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 94/305 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:13:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:13:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 1/240 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/240 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 308 constraints, problems are : Problem set: 0 solved, 94 unsolved in 16484 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints]
After SMT, in 20367ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 20369ms
Starting structural reductions in LI_LTL mode, iteration 1 : 143/261 places, 97/205 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 20640 ms. Remains : 143/261 places, 97/205 transitions.
Running random walk in product with property : DES-PT-05b-LTLFireability-03
Product exploration explored 100000 steps with 33528 reset in 165 ms.
Product exploration explored 100000 steps with 33341 reset in 179 ms.
Computed a total of 38 stabilizing places and 39 stable transitions
Computed a total of 38 stabilizing places and 39 stable transitions
Detected a total of 38/143 stabilizing places and 39/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 357 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (1933 resets) in 196 ms. (203 steps per ms) remains 1/7 properties
BEST_FIRST walk for 38587 steps (365 resets) in 72 ms. (528 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p0), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 728 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 181 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-21 18:14:03] [INFO ] Invariant cache hit.
[2024-05-21 18:14:03] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 18:14:03] [INFO ] Invariant cache hit.
[2024-05-21 18:14:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 18:14:04] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-21 18:14:04] [INFO ] Redundant transitions in 0 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-21 18:14:04] [INFO ] Invariant cache hit.
[2024-05-21 18:14:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/142 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 97/239 variables, 142/201 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/240 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:14:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:14:06] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/240 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 212 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3905 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/142 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 97/239 variables, 142/203 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 94/305 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:14:10] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:14:12] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 1/240 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/240 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 308 constraints, problems are : Problem set: 0 solved, 94 unsolved in 16095 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints]
After SMT, in 20021ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 20023ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20267 ms. Remains : 143/143 places, 97/97 transitions.
Computed a total of 38 stabilizing places and 39 stable transitions
Computed a total of 38 stabilizing places and 39 stable transitions
Detected a total of 38/143 stabilizing places and 39/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 14 factoid took 436 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (1944 resets) in 226 ms. (176 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (397 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2024-05-21 18:14:24] [INFO ] Invariant cache hit.
[2024-05-21 18:14:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/79 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/116 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 9/125 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 88/213 variables, 125/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/227 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/235 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/235 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/235 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/240 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/240 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/79 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 18:14:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/116 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/125 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 88/213 variables, 125/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/227 variables, 10/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/227 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/235 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/235 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/235 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/240 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 97/97 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 143 transition count 96
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 143 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 142 transition count 95
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 142 transition count 95
Applied a total of 4 rules in 8 ms. Remains 142 /143 variables (removed 1) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 142/143 places, 95/97 transitions.
RANDOM walk for 40000 steps (1868 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (372 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1881912 steps, run timeout after 3001 ms. (steps per millisecond=627 ) properties seen :0 out of 1
Probabilistic random walk after 1881912 steps, saw 256078 distinct states, run finished after 3001 ms. (steps per millisecond=627 ) properties seen :0
// Phase 1: matrix 95 rows 142 cols
[2024-05-21 18:14:28] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 18:14:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/47 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/84 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/116 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/125 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 86/211 variables, 125/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/225 variables, 9/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/233 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/233 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/237 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/237 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/47 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/84 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/116 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/125 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 86/211 variables, 125/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/225 variables, 9/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/233 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/233 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/233 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/237 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/237 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/237 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 142/142 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-21 18:14:28] [INFO ] Invariant cache hit.
[2024-05-21 18:14:28] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 18:14:28] [INFO ] Invariant cache hit.
[2024-05-21 18:14:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 18:14:28] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-21 18:14:28] [INFO ] Redundant transitions in 0 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-21 18:14:28] [INFO ] Invariant cache hit.
[2024-05-21 18:14:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 95/236 variables, 141/201 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 18:14:30] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/237 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 211 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2901 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 2/141 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 18:14:32] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-21 18:14:32] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 95/236 variables, 141/204 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 92/304 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 18:14:33] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (OVERLAPS) 1/237 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 18:14:40] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/237 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 18:14:42] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 18:14:44] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-21 18:14:45] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/237 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 18 (OVERLAPS) 0/237 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 310 constraints, problems are : Problem set: 0 solved, 92 unsolved in 18668 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 8/8 constraints]
After SMT, in 21594ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 21596ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21838 ms. Remains : 142/142 places, 95/95 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 436 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 95
Applied a total of 2 rules in 9 ms. Remains 141 /142 variables (removed 1) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 141 cols
[2024-05-21 18:14:50] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 18:14:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:14:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 18:14:50] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:14:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 18:14:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 18:14:50] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 18:14:50] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 18:14:50] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p0), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 576 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 181 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 189 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 28275 reset in 177 ms.
Product exploration explored 100000 steps with 28187 reset in 194 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 143 cols
[2024-05-21 18:14:52] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 18:14:52] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 18:14:52] [INFO ] Invariant cache hit.
[2024-05-21 18:14:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 18:14:52] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-21 18:14:52] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-21 18:14:52] [INFO ] Invariant cache hit.
[2024-05-21 18:14:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/142 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 97/239 variables, 142/201 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/240 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:14:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:14:55] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/240 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 212 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3879 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/142 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 97/239 variables, 142/203 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 94/305 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:14:59] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-21 18:15:01] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 1/240 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/240 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 308 constraints, problems are : Problem set: 0 solved, 94 unsolved in 16327 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints]
After SMT, in 20226ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 20228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20463 ms. Remains : 143/143 places, 97/97 transitions.
Treatment of property DES-PT-05b-LTLFireability-03 finished in 91827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(!p1 U (p2||G(!p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Found a Shortening insensitive property : DES-PT-05b-LTLFireability-15
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 255 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 241 transition count 187
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 241 transition count 175
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 229 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 224 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 224 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 224 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 224 transition count 167
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 68 place count 222 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 221 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 221 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 221 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 220 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 220 place count 147 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 143 transition count 90
Applied a total of 226 rules in 20 ms. Remains 143 /261 variables (removed 118) and now considering 90/205 (removed 115) transitions.
// Phase 1: matrix 90 rows 143 cols
[2024-05-21 18:15:12] [INFO ] Computed 59 invariants in 3 ms
[2024-05-21 18:15:13] [INFO ] Implicit Places using invariants in 94 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 142/261 places, 90/205 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 129 ms. Remains : 142/261 places, 90/205 transitions.
Running random walk in product with property : DES-PT-05b-LTLFireability-15
Product exploration explored 100000 steps with 5068 reset in 195 ms.
Product exploration explored 100000 steps with 5094 reset in 221 ms.
Computed a total of 39 stabilizing places and 34 stable transitions
Computed a total of 39 stabilizing places and 34 stable transitions
Detected a total of 39/142 stabilizing places and 34/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 333 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 142 cols
[2024-05-21 18:15:14] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 18:15:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 18:15:14] [INFO ] Invariant cache hit.
[2024-05-21 18:15:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 18:15:14] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-21 18:15:14] [INFO ] Invariant cache hit.
[2024-05-21 18:15:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:15] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:15:15] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-21 18:15:15] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:16] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-21 18:15:16] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 90/232 variables, 142/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:18] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:18] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 16 (OVERLAPS) 0/232 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 215 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4692 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 2/141 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/142 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:20] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:15:20] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-21 18:15:20] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:15:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:15:20] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:15:20] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 90/232 variables, 142/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 87/308 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:23] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:26] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:15:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/232 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/232 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 20 (OVERLAPS) 0/232 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 314 constraints, problems are : Problem set: 0 solved, 87 unsolved in 20380 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 21/21 constraints]
After SMT, in 25093ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 25095ms
Finished structural reductions in LTL mode , in 1 iterations and 25317 ms. Remains : 142/142 places, 90/90 transitions.
Computed a total of 39 stabilizing places and 34 stable transitions
Computed a total of 39 stabilizing places and 34 stable transitions
Detected a total of 39/142 stabilizing places and 34/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 19 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 379 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5030 reset in 192 ms.
Product exploration explored 100000 steps with 4999 reset in 215 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 13 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-21 18:15:41] [INFO ] Redundant transitions in 0 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-21 18:15:41] [INFO ] Invariant cache hit.
[2024-05-21 18:15:41] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-21 18:15:42] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-21 18:15:42] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:43] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-21 18:15:43] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 90/232 variables, 142/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:44] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:44] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 16 (OVERLAPS) 0/232 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 215 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4525 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 2/141 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/142 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-21 18:15:47] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:15:47] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-21 18:15:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:15:47] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-21 18:15:47] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 90/232 variables, 142/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 87/308 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:50] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:53] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:15:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-21 18:15:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/232 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/232 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 20 (OVERLAPS) 0/232 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 314 constraints, problems are : Problem set: 0 solved, 87 unsolved in 20601 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 21/21 constraints]
After SMT, in 25141ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 25142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25159 ms. Remains : 142/142 places, 90/90 transitions.
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-21 18:16:06] [INFO ] Invariant cache hit.
[2024-05-21 18:16:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 18:16:06] [INFO ] Invariant cache hit.
[2024-05-21 18:16:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 18:16:07] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-21 18:16:07] [INFO ] Invariant cache hit.
[2024-05-21 18:16:07] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:16:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:16:08] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:08] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-21 18:16:08] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 90/232 variables, 142/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:09] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:10] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 16 (OVERLAPS) 0/232 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 215 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4671 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 2/141 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/142 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:16:12] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:16:12] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-21 18:16:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-21 18:16:12] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-21 18:16:12] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 90/232 variables, 142/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 87/308 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:15] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:19] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 18:16:25] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:16:25] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/232 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/232 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 20 (OVERLAPS) 0/232 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 314 constraints, problems are : Problem set: 0 solved, 87 unsolved in 20953 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 21/21 constraints]
After SMT, in 25639ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 25642ms
Finished structural reductions in LTL mode , in 1 iterations and 25860 ms. Remains : 142/142 places, 90/90 transitions.
Treatment of property DES-PT-05b-LTLFireability-15 finished in 80063 ms.
[2024-05-21 18:16:32] [INFO ] Flatten gal took : 13 ms
[2024-05-21 18:16:32] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 18:16:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 261 places, 205 transitions and 627 arcs took 6 ms.
Total runtime 871460 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 261
TRANSITIONS: 205
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4866
MODEL NAME: /home/mcc/execution/414/model
261 places, 205 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-05b-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-05b-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="DES-PT-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-05b, 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 r091-tall-171624188200660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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