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.r564-tall-171734907800202.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 ltsminxred
Input is FireWire-PT-20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907800202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717362647191

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:10:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 21:10:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:10:48] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-02 21:10:48] [INFO ] Transformed 626 places.
[2024-06-02 21:10:48] [INFO ] Transformed 1031 transitions.
[2024-06-02 21:10:48] [INFO ] Found NUPN structural information;
[2024-06-02 21:10:48] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 215 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 602 transition count 900
Reduce places removed 121 places and 0 transitions.
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 1 with 123 rules applied. Total rules applied 260 place count 481 transition count 898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 261 place count 480 transition count 898
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 261 place count 480 transition count 882
Deduced a syphon composed of 16 places in 17 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 293 place count 464 transition count 882
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 2 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 587 place count 317 transition count 735
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 590 place count 317 transition count 732
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 680 place count 272 transition count 1039
Applied a total of 680 rules in 138 ms. Remains 272 /626 variables (removed 354) and now considering 1039/1031 (removed -8) transitions.
[2024-06-02 21:10:48] [INFO ] Flow matrix only has 986 transitions (discarded 53 similar events)
// Phase 1: matrix 986 rows 272 cols
[2024-06-02 21:10:48] [INFO ] Computed 10 invariants in 25 ms
[2024-06-02 21:10:49] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-02 21:10:49] [INFO ] Flow matrix only has 986 transitions (discarded 53 similar events)
[2024-06-02 21:10:49] [INFO ] Invariant cache hit.
[2024-06-02 21:10:49] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-02 21:10:50] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1748 ms to find 0 implicit places.
Running 1012 sub problems to find dead transitions.
[2024-06-02 21:10:50] [INFO ] Flow matrix only has 986 transitions (discarded 53 similar events)
[2024-06-02 21:10:50] [INFO ] Invariant cache hit.
[2024-06-02 21:10:50] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 271/271 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 10/281 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
[2024-06-02 21:11:05] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 20 ms to minimize.
[2024-06-02 21:11:06] [INFO ] Deduced a trap composed of 96 places in 326 ms of which 3 ms to minimize.
[2024-06-02 21:11:06] [INFO ] Deduced a trap composed of 88 places in 278 ms of which 2 ms to minimize.
[2024-06-02 21:11:07] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:11:07] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 1 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 10 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 189 places in 157 ms of which 2 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 2 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:11:09] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 1 ms to minimize.
[2024-06-02 21:11:09] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 0 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 18/300 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
[2024-06-02 21:11:17] [INFO ] Deduced a trap composed of 189 places in 167 ms of which 2 ms to minimize.
[2024-06-02 21:11:17] [INFO ] Deduced a trap composed of 189 places in 151 ms of which 1 ms to minimize.
[2024-06-02 21:11:17] [INFO ] Deduced a trap composed of 199 places in 154 ms of which 2 ms to minimize.
[2024-06-02 21:11:19] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 272/1258 variables, and 304 constraints, problems are : Problem set: 0 solved, 1012 unsolved in 30032 ms.
Refiners :[Domain max(s): 272/272 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/272 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 1012/1012 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1012 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 271/271 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 10/281 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 22/304 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 6 (OVERLAPS) 985/1257 variables, 272/576 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1257 variables, 18/594 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 1012/1606 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1257/1258 variables, and 1606 constraints, problems are : Problem set: 0 solved, 1012 unsolved in 30022 ms.
Refiners :[Domain max(s): 272/272 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 272/272 constraints, ReadFeed: 18/19 constraints, PredecessorRefiner: 1012/1012 constraints, Known Traps: 22/22 constraints]
After SMT, in 61785ms problems are : Problem set: 0 solved, 1012 unsolved
Search for dead transitions found 0 dead transitions in 61813ms
Starting structural reductions in LIVENESS mode, iteration 1 : 272/626 places, 1039/1031 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63741 ms. Remains : 272/626 places, 1039/1031 transitions.
Discarding 473 transitions out of 1039. Remains 566
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1520 resets) in 2912 ms. (13 steps per ms) remains 431/565 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 431/431 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 431/431 properties
[2024-06-02 21:11:53] [INFO ] Flow matrix only has 986 transitions (discarded 53 similar events)
[2024-06-02 21:11:53] [INFO ] Invariant cache hit.
[2024-06-02 21:11:53] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 23/263 variables, 10/250 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 23/273 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/1258 variables, and 273 constraints, problems are : Problem set: 0 solved, 431 unsolved in 5019 ms.
Refiners :[Domain max(s): 263/272 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/272 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 23/263 variables, 10/250 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 23/273 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 21:12:01] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 2 ms to minimize.
[2024-06-02 21:12:01] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:12:02] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:12:02] [INFO ] Deduced a trap composed of 150 places in 243 ms of which 3 ms to minimize.
[2024-06-02 21:12:02] [INFO ] Deduced a trap composed of 179 places in 161 ms of which 2 ms to minimize.
[2024-06-02 21:12:02] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 1 ms to minimize.
[2024-06-02 21:12:02] [INFO ] Deduced a trap composed of 189 places in 156 ms of which 2 ms to minimize.
[2024-06-02 21:12:02] [INFO ] Deduced a trap composed of 199 places in 144 ms of which 2 ms to minimize.
[2024-06-02 21:12:03] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 2 ms to minimize.
[2024-06-02 21:12:04] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 2 ms to minimize.
SMT process timed out in 10681ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 240 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 1039/1039 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 272 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 269 transition count 1033
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 269 transition count 1033
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 28 place count 269 transition count 1014
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 269 transition count 1002
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 269 transition count 996
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 263 transition count 996
Applied a total of 52 rules in 112 ms. Remains 263 /272 variables (removed 9) and now considering 996/1039 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 263/272 places, 996/1039 transitions.
RANDOM walk for 4000000 steps (125138 resets) in 62224 ms. (64 steps per ms) remains 223/431 properties
BEST_FIRST walk for 40004 steps (133 resets) in 377 ms. (105 steps per ms) remains 214/223 properties
BEST_FIRST walk for 40004 steps (132 resets) in 198 ms. (201 steps per ms) remains 212/214 properties
BEST_FIRST walk for 40003 steps (253 resets) in 196 ms. (203 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (130 resets) in 206 ms. (193 steps per ms) remains 206/212 properties
BEST_FIRST walk for 40003 steps (239 resets) in 187 ms. (212 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40003 steps (137 resets) in 190 ms. (209 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40002 steps (253 resets) in 117 ms. (339 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (130 resets) in 111 ms. (357 steps per ms) remains 205/206 properties
BEST_FIRST walk for 40002 steps (245 resets) in 102 ms. (388 steps per ms) remains 205/205 properties
BEST_FIRST walk for 40003 steps (127 resets) in 110 ms. (360 steps per ms) remains 204/205 properties
BEST_FIRST walk for 40003 steps (240 resets) in 109 ms. (363 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40003 steps (133 resets) in 112 ms. (354 steps per ms) remains 203/204 properties
BEST_FIRST walk for 40003 steps (243 resets) in 109 ms. (363 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40002 steps (131 resets) in 108 ms. (366 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (240 resets) in 157 ms. (253 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (243 resets) in 110 ms. (360 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40003 steps (125 resets) in 114 ms. (347 steps per ms) remains 202/203 properties
BEST_FIRST walk for 40004 steps (240 resets) in 104 ms. (380 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (131 resets) in 110 ms. (360 steps per ms) remains 199/202 properties
BEST_FIRST walk for 40002 steps (238 resets) in 102 ms. (388 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40004 steps (127 resets) in 110 ms. (360 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40002 steps (249 resets) in 104 ms. (380 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40004 steps (137 resets) in 111 ms. (357 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40004 steps (234 resets) in 105 ms. (377 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (128 resets) in 174 ms. (228 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40002 steps (244 resets) in 149 ms. (266 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (134 resets) in 133 ms. (298 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (247 resets) in 117 ms. (339 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40004 steps (134 resets) in 109 ms. (363 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (133 resets) in 111 ms. (357 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40002 steps (240 resets) in 109 ms. (363 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (129 resets) in 108 ms. (367 steps per ms) remains 198/199 properties
BEST_FIRST walk for 40004 steps (245 resets) in 101 ms. (392 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (134 resets) in 107 ms. (370 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40003 steps (244 resets) in 100 ms. (396 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40003 steps (129 resets) in 107 ms. (370 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40002 steps (226 resets) in 99 ms. (400 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40003 steps (134 resets) in 109 ms. (363 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (251 resets) in 101 ms. (392 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (131 resets) in 106 ms. (373 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40002 steps (245 resets) in 104 ms. (380 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40003 steps (133 resets) in 114 ms. (347 steps per ms) remains 197/198 properties
BEST_FIRST walk for 40002 steps (251 resets) in 100 ms. (396 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40002 steps (244 resets) in 96 ms. (412 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (231 resets) in 97 ms. (408 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (237 resets) in 96 ms. (412 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (239 resets) in 98 ms. (404 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (233 resets) in 100 ms. (396 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (234 resets) in 100 ms. (396 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (229 resets) in 99 ms. (400 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (235 resets) in 98 ms. (404 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (231 resets) in 105 ms. (377 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40004 steps (230 resets) in 95 ms. (416 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40001 steps (238 resets) in 95 ms. (416 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40003 steps (127 resets) in 110 ms. (360 steps per ms) remains 195/197 properties
BEST_FIRST walk for 40001 steps (129 resets) in 108 ms. (366 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (126 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (125 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (127 resets) in 107 ms. (370 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (235 resets) in 99 ms. (400 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (235 resets) in 101 ms. (392 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (248 resets) in 97 ms. (408 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (262 resets) in 99 ms. (400 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (231 resets) in 100 ms. (396 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (248 resets) in 100 ms. (396 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (244 resets) in 98 ms. (404 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (230 resets) in 100 ms. (396 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (242 resets) in 100 ms. (396 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (237 resets) in 100 ms. (396 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (252 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (229 resets) in 102 ms. (388 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (239 resets) in 104 ms. (380 steps per ms) remains 194/195 properties
BEST_FIRST walk for 40003 steps (242 resets) in 110 ms. (360 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (249 resets) in 103 ms. (384 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (240 resets) in 100 ms. (396 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (236 resets) in 104 ms. (380 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40001 steps (245 resets) in 99 ms. (400 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (242 resets) in 100 ms. (396 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (234 resets) in 102 ms. (388 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (241 resets) in 103 ms. (384 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40001 steps (250 resets) in 101 ms. (392 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (242 resets) in 102 ms. (388 steps per ms) remains 193/194 properties
BEST_FIRST walk for 40003 steps (236 resets) in 101 ms. (392 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (242 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (248 resets) in 107 ms. (370 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (235 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (236 resets) in 106 ms. (373 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (238 resets) in 106 ms. (373 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (244 resets) in 103 ms. (384 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (254 resets) in 99 ms. (400 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (250 resets) in 98 ms. (404 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (246 resets) in 99 ms. (400 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (247 resets) in 105 ms. (377 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (240 resets) in 98 ms. (404 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (235 resets) in 98 ms. (404 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (233 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40001 steps (233 resets) in 98 ms. (404 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (234 resets) in 98 ms. (404 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (243 resets) in 100 ms. (396 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (242 resets) in 99 ms. (400 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (262 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (254 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (254 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (247 resets) in 101 ms. (392 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (245 resets) in 103 ms. (384 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (237 resets) in 101 ms. (392 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (245 resets) in 101 ms. (392 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (244 resets) in 103 ms. (384 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (244 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (246 resets) in 101 ms. (392 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (256 resets) in 115 ms. (344 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (253 resets) in 109 ms. (363 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40001 steps (241 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (237 resets) in 104 ms. (380 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (241 resets) in 103 ms. (384 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (248 resets) in 100 ms. (396 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (235 resets) in 106 ms. (373 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (245 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (248 resets) in 99 ms. (400 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (226 resets) in 94 ms. (421 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (253 resets) in 103 ms. (384 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (246 resets) in 101 ms. (392 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (250 resets) in 105 ms. (377 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (238 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (245 resets) in 101 ms. (392 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (239 resets) in 100 ms. (396 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (233 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (245 resets) in 102 ms. (388 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (207 resets) in 89 ms. (444 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (210 resets) in 87 ms. (454 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (205 resets) in 90 ms. (439 steps per ms) remains 193/193 properties
[2024-06-02 21:12:24] [INFO ] Flow matrix only has 945 transitions (discarded 51 similar events)
// Phase 1: matrix 945 rows 263 cols
[2024-06-02 21:12:24] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 21:12:24] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 120/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 21:12:25] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 3 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:12:26] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 1 ms to minimize.
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 2 ms to minimize.
[2024-06-02 21:12:27] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 945/1199 variables, 254/275 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1199 variables, 21/296 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 21:12:33] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1199 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1199 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 9/1208 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1208 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/1208 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 306 constraints, problems are : Problem set: 0 solved, 193 unsolved in 35346 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 263/263 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 120/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 945/1199 variables, 254/276 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1199 variables, 21/297 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1199 variables, 181/478 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1199 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 9/1208 variables, 9/487 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1208 variables, 12/499 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1208 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 499 constraints, problems are : Problem set: 0 solved, 193 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 263/263 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 12/12 constraints]
After SMT, in 80603ms problems are : Problem set: 0 solved, 193 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 134 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 996/996 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 257 transition count 729
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 257 transition count 729
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 257 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 254 transition count 718
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 254 transition count 718
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 29 place count 254 transition count 709
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 254 transition count 704
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 39 place count 249 transition count 704
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 48 place count 249 transition count 695
Applied a total of 48 rules in 60 ms. Remains 249 /263 variables (removed 14) and now considering 695/996 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 249/263 places, 695/996 transitions.
RANDOM walk for 4000000 steps (119787 resets) in 46009 ms. (86 steps per ms) remains 171/193 properties
BEST_FIRST walk for 40004 steps (91 resets) in 102 ms. (388 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (231 resets) in 98 ms. (404 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (89 resets) in 97 ms. (408 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (250 resets) in 95 ms. (416 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (89 resets) in 101 ms. (392 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40001 steps (242 resets) in 96 ms. (412 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (91 resets) in 103 ms. (384 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (238 resets) in 100 ms. (396 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (91 resets) in 100 ms. (396 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (226 resets) in 96 ms. (412 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (90 resets) in 102 ms. (388 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (237 resets) in 98 ms. (404 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (238 resets) in 104 ms. (380 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (93 resets) in 102 ms. (388 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40001 steps (237 resets) in 100 ms. (396 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (89 resets) in 106 ms. (373 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (236 resets) in 101 ms. (392 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (91 resets) in 104 ms. (380 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (242 resets) in 96 ms. (412 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (88 resets) in 102 ms. (388 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (235 resets) in 99 ms. (400 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (91 resets) in 103 ms. (384 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (228 resets) in 98 ms. (404 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (86 resets) in 103 ms. (384 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (95 resets) in 102 ms. (388 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (225 resets) in 98 ms. (404 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (90 resets) in 101 ms. (392 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (230 resets) in 97 ms. (408 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (93 resets) in 101 ms. (392 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (242 resets) in 94 ms. (421 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (86 resets) in 101 ms. (392 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (239 resets) in 109 ms. (363 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (90 resets) in 115 ms. (344 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (242 resets) in 96 ms. (412 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (89 resets) in 102 ms. (388 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (223 resets) in 102 ms. (388 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (91 resets) in 230 ms. (173 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (245 resets) in 133 ms. (298 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (239 resets) in 199 ms. (200 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (235 resets) in 112 ms. (354 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (224 resets) in 124 ms. (320 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (236 resets) in 208 ms. (191 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (211 resets) in 212 ms. (187 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (217 resets) in 129 ms. (307 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (226 resets) in 143 ms. (277 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (221 resets) in 214 ms. (186 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (229 resets) in 115 ms. (344 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (230 resets) in 145 ms. (273 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (207 resets) in 181 ms. (219 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (90 resets) in 196 ms. (203 steps per ms) remains 171/171 properties
[2024-06-02 21:13:58] [INFO ] Flow matrix only has 676 transitions (discarded 19 similar events)
// Phase 1: matrix 676 rows 249 cols
[2024-06-02 21:13:58] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:13:58] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 123/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 2 ms to minimize.
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 0 ms to minimize.
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:14:01] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:14:01] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:14:01] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 676/916 variables, 240/262 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 14/276 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 9/925 variables, 9/285 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/925 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 925/925 variables, and 285 constraints, problems are : Problem set: 0 solved, 171 unsolved in 20228 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 123/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 676/916 variables, 240/262 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 14/276 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 162/438 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 9/925 variables, 9/447 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/925 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 925/925 variables, and 456 constraints, problems are : Problem set: 0 solved, 171 unsolved in 55812 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 12/12 constraints]
After SMT, in 76222ms problems are : Problem set: 0 solved, 171 unsolved
Parikh walk visited 0 properties in 23987 ms.
Support contains 117 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 695/695 transitions.
Applied a total of 0 rules in 13 ms. Remains 249 /249 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 249/249 places, 695/695 transitions.
RANDOM walk for 4000000 steps (119842 resets) in 54882 ms. (72 steps per ms) remains 166/171 properties
BEST_FIRST walk for 40004 steps (88 resets) in 130 ms. (305 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (251 resets) in 139 ms. (285 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (96 resets) in 139 ms. (285 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (244 resets) in 209 ms. (190 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (90 resets) in 177 ms. (224 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (222 resets) in 159 ms. (250 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (89 resets) in 136 ms. (291 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (237 resets) in 192 ms. (207 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (95 resets) in 110 ms. (360 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (239 resets) in 204 ms. (195 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (88 resets) in 230 ms. (173 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (239 resets) in 122 ms. (325 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (240 resets) in 183 ms. (217 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (96 resets) in 201 ms. (198 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40001 steps (239 resets) in 120 ms. (330 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (93 resets) in 132 ms. (300 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (228 resets) in 224 ms. (177 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (92 resets) in 148 ms. (268 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (236 resets) in 190 ms. (209 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (87 resets) in 136 ms. (292 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (219 resets) in 255 ms. (156 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (88 resets) in 222 ms. (179 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (231 resets) in 107 ms. (370 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (89 resets) in 235 ms. (169 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (232 resets) in 112 ms. (354 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (91 resets) in 210 ms. (189 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (238 resets) in 169 ms. (235 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (92 resets) in 232 ms. (171 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (250 resets) in 217 ms. (183 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (90 resets) in 148 ms. (268 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (222 resets) in 235 ms. (169 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (93 resets) in 270 ms. (147 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (223 resets) in 204 ms. (195 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (86 resets) in 223 ms. (178 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (240 resets) in 139 ms. (285 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (89 resets) in 268 ms. (148 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (231 resets) in 242 ms. (164 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (219 resets) in 187 ms. (212 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (252 resets) in 177 ms. (224 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (214 resets) in 112 ms. (354 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (224 resets) in 207 ms. (192 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (223 resets) in 173 ms. (229 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (224 resets) in 122 ms. (325 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (229 resets) in 178 ms. (223 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (232 resets) in 224 ms. (177 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (234 resets) in 152 ms. (261 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (224 resets) in 168 ms. (236 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (231 resets) in 161 ms. (246 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (89 resets) in 133 ms. (298 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (89 resets) in 275 ms. (144 steps per ms) remains 166/166 properties
Interrupted probabilistic random walk after 4399717 steps, run timeout after 60001 ms. (steps per millisecond=73 ) properties seen :38 out of 166
Probabilistic random walk after 4399717 steps, saw 1488619 distinct states, run finished after 60012 ms. (steps per millisecond=73 ) properties seen :38
[2024-06-02 21:16:59] [INFO ] Flow matrix only has 676 transitions (discarded 19 similar events)
[2024-06-02 21:16:59] [INFO ] Invariant cache hit.
[2024-06-02 21:16:59] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 150/235 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 21:17:00] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 6 ms to minimize.
[2024-06-02 21:17:00] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:17:00] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-06-02 21:17:00] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
[2024-06-02 21:17:00] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:17:00] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:17:00] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 2 ms to minimize.
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 21:17:02] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 676/911 variables, 235/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 14/270 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 14/925 variables, 14/284 constraints. Problems are: Problem set: 0 solved, 128 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/925 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 925/925 variables, and 284 constraints, problems are : Problem set: 0 solved, 128 unsolved in 9982 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 150/235 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 676/911 variables, 235/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 14/270 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 124/394 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 14/925 variables, 14/408 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 0/925 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 925/925 variables, and 412 constraints, problems are : Problem set: 0 solved, 128 unsolved in 35524 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 11/11 constraints]
After SMT, in 45631ms problems are : Problem set: 0 solved, 128 unsolved
Parikh walk visited 0 properties in 25354 ms.
Support contains 85 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 695/695 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 236 transition count 679
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 236 transition count 679
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 236 transition count 676
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 41 place count 233 transition count 667
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 231 transition count 665
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 231 transition count 665
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 231 transition count 659
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 67 place count 231 transition count 643
Applied a total of 67 rules in 49 ms. Remains 231 /249 variables (removed 18) and now considering 643/695 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 231/249 places, 643/695 transitions.
RANDOM walk for 4000000 steps (124525 resets) in 70803 ms. (56 steps per ms) remains 127/128 properties
BEST_FIRST walk for 40002 steps (90 resets) in 138 ms. (287 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (246 resets) in 174 ms. (228 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (85 resets) in 146 ms. (272 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40003 steps (242 resets) in 177 ms. (224 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (94 resets) in 206 ms. (193 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (225 resets) in 115 ms. (344 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (92 resets) in 207 ms. (192 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40002 steps (250 resets) in 163 ms. (243 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40003 steps (87 resets) in 98 ms. (404 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40002 steps (245 resets) in 195 ms. (204 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40003 steps (94 resets) in 127 ms. (312 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (234 resets) in 99 ms. (400 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (236 resets) in 195 ms. (204 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40002 steps (87 resets) in 120 ms. (330 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (238 resets) in 184 ms. (216 steps per ms) remains 126/127 properties
BEST_FIRST walk for 40004 steps (90 resets) in 173 ms. (229 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (230 resets) in 142 ms. (279 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (90 resets) in 139 ms. (285 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (250 resets) in 127 ms. (312 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (87 resets) in 128 ms. (310 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (241 resets) in 119 ms. (333 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (87 resets) in 186 ms. (213 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (239 resets) in 122 ms. (325 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (250 resets) in 107 ms. (370 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (93 resets) in 183 ms. (217 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (240 resets) in 197 ms. (202 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (97 resets) in 163 ms. (243 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (235 resets) in 130 ms. (305 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (90 resets) in 233 ms. (170 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (239 resets) in 182 ms. (218 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (91 resets) in 134 ms. (296 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (228 resets) in 168 ms. (236 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (89 resets) in 144 ms. (275 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (247 resets) in 119 ms. (333 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (256 resets) in 143 ms. (277 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (236 resets) in 115 ms. (344 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (222 resets) in 126 ms. (314 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (236 resets) in 162 ms. (245 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (220 resets) in 114 ms. (347 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (220 resets) in 200 ms. (199 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (86 resets) in 189 ms. (210 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (93 resets) in 123 ms. (322 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (94 resets) in 191 ms. (208 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (242 resets) in 106 ms. (373 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (236 resets) in 206 ms. (193 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (255 resets) in 165 ms. (240 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (238 resets) in 161 ms. (246 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (230 resets) in 117 ms. (339 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (242 resets) in 190 ms. (209 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (244 resets) in 212 ms. (187 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (236 resets) in 176 ms. (226 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (244 resets) in 116 ms. (341 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (242 resets) in 174 ms. (228 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (253 resets) in 131 ms. (303 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (236 resets) in 194 ms. (205 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (233 resets) in 114 ms. (347 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (230 resets) in 132 ms. (300 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (237 resets) in 207 ms. (192 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (231 resets) in 131 ms. (303 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (228 resets) in 185 ms. (215 steps per ms) remains 125/126 properties
BEST_FIRST walk for 40004 steps (234 resets) in 154 ms. (258 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (241 resets) in 106 ms. (373 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (239 resets) in 226 ms. (176 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (250 resets) in 185 ms. (215 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (233 resets) in 82 ms. (481 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (235 resets) in 186 ms. (213 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40001 steps (237 resets) in 195 ms. (204 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (241 resets) in 177 ms. (224 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (245 resets) in 133 ms. (298 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (242 resets) in 110 ms. (360 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (244 resets) in 160 ms. (248 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (242 resets) in 135 ms. (294 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (239 resets) in 105 ms. (377 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (253 resets) in 195 ms. (204 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (239 resets) in 244 ms. (163 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (232 resets) in 136 ms. (291 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (228 resets) in 117 ms. (339 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (250 resets) in 171 ms. (232 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (238 resets) in 105 ms. (377 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (250 resets) in 164 ms. (242 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (244 resets) in 131 ms. (303 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (246 resets) in 178 ms. (223 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (246 resets) in 172 ms. (231 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (255 resets) in 123 ms. (322 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (243 resets) in 222 ms. (179 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (243 resets) in 166 ms. (239 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (248 resets) in 91 ms. (434 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (239 resets) in 209 ms. (190 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (249 resets) in 124 ms. (320 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (257 resets) in 206 ms. (193 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (243 resets) in 132 ms. (300 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (258 resets) in 160 ms. (248 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (239 resets) in 126 ms. (314 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (238 resets) in 86 ms. (459 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (247 resets) in 178 ms. (223 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (247 resets) in 133 ms. (298 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (233 resets) in 241 ms. (165 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (246 resets) in 113 ms. (350 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (229 resets) in 129 ms. (307 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (247 resets) in 140 ms. (283 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (235 resets) in 148 ms. (268 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (253 resets) in 110 ms. (360 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (250 resets) in 122 ms. (325 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (242 resets) in 106 ms. (373 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (250 resets) in 163 ms. (243 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (250 resets) in 195 ms. (204 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (227 resets) in 146 ms. (272 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (245 resets) in 181 ms. (219 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (210 resets) in 172 ms. (231 steps per ms) remains 125/125 properties
Interrupted probabilistic random walk after 6162831 steps, run timeout after 75001 ms. (steps per millisecond=82 ) properties seen :0 out of 125
Probabilistic random walk after 6162831 steps, saw 1943049 distinct states, run finished after 75002 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-02 21:19:50] [INFO ] Flow matrix only has 632 transitions (discarded 11 similar events)
// Phase 1: matrix 632 rows 231 cols
[2024-06-02 21:19:50] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:19:50] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 135/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:19:52] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:19:52] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 4/220 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 632/852 variables, 220/238 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 73/311 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 11/863 variables, 11/322 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 21:20:00] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/863 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/863 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/863 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 863/863 variables, and 323 constraints, problems are : Problem set: 0 solved, 125 unsolved in 15910 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 231/231 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 135/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 4/220 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 632/852 variables, 220/239 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 73/312 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 121/433 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 21:20:10] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/852 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 11/863 variables, 11/445 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/863 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/863 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 21:20:36] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:20:36] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/863 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/863 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 16 (OVERLAPS) 0/863 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 863/863 variables, and 451 constraints, problems are : Problem set: 0 solved, 125 unsolved in 65572 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 231/231 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 12/12 constraints]
After SMT, in 81644ms problems are : Problem set: 0 solved, 125 unsolved
Parikh walk visited 0 properties in 8872 ms.
Support contains 81 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 643/643 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 642
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 642
Applied a total of 2 rules in 14 ms. Remains 230 /231 variables (removed 1) and now considering 642/643 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 230/231 places, 642/643 transitions.
RANDOM walk for 4000000 steps (124455 resets) in 35736 ms. (111 steps per ms) remains 123/125 properties
BEST_FIRST walk for 40003 steps (92 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (251 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (91 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (241 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (87 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (238 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (87 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (235 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (92 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (243 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (92 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (238 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (242 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (90 resets) in 88 ms. (449 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (248 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (93 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (241 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (90 resets) in 90 ms. (439 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (224 resets) in 97 ms. (408 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (88 resets) in 102 ms. (388 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (232 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (89 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (237 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (227 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (91 resets) in 89 ms. (444 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (235 resets) in 83 ms. (476 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (87 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (244 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (88 resets) in 87 ms. (454 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (238 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (91 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (242 resets) in 82 ms. (481 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (90 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (229 resets) in 79 ms. (500 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (239 resets) in 79 ms. (500 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (238 resets) in 77 ms. (512 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (228 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (224 resets) in 76 ms. (519 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (241 resets) in 78 ms. (506 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (229 resets) in 79 ms. (500 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (90 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (87 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (90 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (244 resets) in 80 ms. (493 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (244 resets) in 80 ms. (493 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (239 resets) in 80 ms. (493 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (231 resets) in 78 ms. (506 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (247 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (244 resets) in 81 ms. (487 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (238 resets) in 86 ms. (459 steps per ms) remains 123/123 properties
Interrupted probabilistic random walk after 2662460 steps, run timeout after 30001 ms. (steps per millisecond=88 ) properties seen :0 out of 123
Probabilistic random walk after 2662460 steps, saw 890005 distinct states, run finished after 30001 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-02 21:22:02] [INFO ] Flow matrix only has 631 transitions (discarded 11 similar events)
// Phase 1: matrix 631 rows 230 cols
[2024-06-02 21:22:02] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:22:02] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 136/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 21:22:02] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:22:02] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:22:03] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/219 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 21:22:05] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 631/850 variables, 219/238 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 73/311 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/850 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 11/861 variables, 11/322 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/861 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/861 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 322 constraints, problems are : Problem set: 0 solved, 123 unsolved in 14425 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 136/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/219 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 631/850 variables, 219/238 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 73/311 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/850 variables, 119/430 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/850 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 11/861 variables, 11/441 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 445 constraints, problems are : Problem set: 0 solved, 123 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 9/9 constraints]
After SMT, in 44554ms problems are : Problem set: 0 solved, 123 unsolved
Parikh walk visited 0 properties in 18336 ms.
Support contains 80 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 642/642 transitions.
Applied a total of 0 rules in 12 ms. Remains 230 /230 variables (removed 0) and now considering 642/642 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 230/230 places, 642/642 transitions.
RANDOM walk for 4000000 steps (124693 resets) in 35393 ms. (113 steps per ms) remains 122/123 properties
BEST_FIRST walk for 40002 steps (91 resets) in 143 ms. (277 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (247 resets) in 132 ms. (300 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (88 resets) in 107 ms. (370 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (247 resets) in 109 ms. (363 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (86 resets) in 120 ms. (330 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (242 resets) in 165 ms. (240 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (93 resets) in 212 ms. (187 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (238 resets) in 115 ms. (344 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (90 resets) in 189 ms. (210 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (236 resets) in 121 ms. (327 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (91 resets) in 117 ms. (339 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (234 resets) in 118 ms. (336 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (241 resets) in 178 ms. (223 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (93 resets) in 110 ms. (360 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (251 resets) in 107 ms. (370 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (89 resets) in 144 ms. (275 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (243 resets) in 164 ms. (242 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40001 steps (92 resets) in 112 ms. (353 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (257 resets) in 173 ms. (229 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (91 resets) in 120 ms. (330 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40002 steps (243 resets) in 108 ms. (366 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (90 resets) in 178 ms. (223 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (245 resets) in 170 ms. (233 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (252 resets) in 169 ms. (235 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (93 resets) in 91 ms. (434 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (257 resets) in 191 ms. (208 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (90 resets) in 121 ms. (327 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (236 resets) in 140 ms. (283 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (94 resets) in 123 ms. (322 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (241 resets) in 190 ms. (209 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40002 steps (94 resets) in 108 ms. (366 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (233 resets) in 147 ms. (270 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (91 resets) in 163 ms. (243 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (247 resets) in 151 ms. (263 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (244 resets) in 83 ms. (476 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (232 resets) in 201 ms. (198 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (236 resets) in 105 ms. (377 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (246 resets) in 107 ms. (370 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (234 resets) in 154 ms. (258 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (221 resets) in 146 ms. (272 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (90 resets) in 139 ms. (285 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (93 resets) in 109 ms. (363 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (91 resets) in 179 ms. (222 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (252 resets) in 83 ms. (476 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (236 resets) in 203 ms. (196 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (252 resets) in 105 ms. (377 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (253 resets) in 162 ms. (245 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40004 steps (243 resets) in 89 ms. (444 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40002 steps (250 resets) in 186 ms. (213 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40002 steps (246 resets) in 197 ms. (202 steps per ms) remains 122/122 properties
Interrupted probabilistic random walk after 2839958 steps, run timeout after 36001 ms. (steps per millisecond=78 ) properties seen :0 out of 122
Probabilistic random walk after 2839958 steps, saw 945126 distinct states, run finished after 36003 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-02 21:23:53] [INFO ] Flow matrix only has 631 transitions (discarded 11 similar events)
[2024-06-02 21:23:53] [INFO ] Invariant cache hit.
[2024-06-02 21:23:53] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 134/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-02 21:23:53] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:23:54] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:23:54] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:23:54] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:23:54] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:23:54] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:23:54] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 7/219 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-02 21:23:56] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:23:56] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 631/850 variables, 219/238 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 73/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/850 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 11/861 variables, 11/322 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/861 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/861 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 322 constraints, problems are : Problem set: 0 solved, 122 unsolved in 14933 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 134/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 7/219 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 631/850 variables, 219/238 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 73/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/850 variables, 118/429 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/850 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 11/861 variables, 11/440 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 444 constraints, problems are : Problem set: 0 solved, 122 unsolved in 31931 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
After SMT, in 46981ms problems are : Problem set: 0 solved, 122 unsolved
Parikh walk visited 0 properties in 10887 ms.
Support contains 78 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 642/642 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 641
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 641
Applied a total of 2 rules in 13 ms. Remains 229 /230 variables (removed 1) and now considering 641/642 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 229/230 places, 641/642 transitions.
RANDOM walk for 4000000 steps (124668 resets) in 57803 ms. (69 steps per ms) remains 121/122 properties
BEST_FIRST walk for 40004 steps (87 resets) in 92 ms. (430 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (246 resets) in 207 ms. (192 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (90 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (232 resets) in 136 ms. (292 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (93 resets) in 156 ms. (254 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (235 resets) in 130 ms. (305 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (93 resets) in 125 ms. (317 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (254 resets) in 196 ms. (203 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (93 resets) in 108 ms. (367 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (248 resets) in 150 ms. (264 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (93 resets) in 131 ms. (303 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (241 resets) in 153 ms. (259 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (235 resets) in 144 ms. (275 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (93 resets) in 90 ms. (439 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (241 resets) in 235 ms. (169 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (91 resets) in 228 ms. (174 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (247 resets) in 99 ms. (400 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (94 resets) in 198 ms. (201 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (229 resets) in 100 ms. (396 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (87 resets) in 106 ms. (373 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (236 resets) in 185 ms. (215 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (91 resets) in 147 ms. (270 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (233 resets) in 113 ms. (350 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (242 resets) in 234 ms. (170 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (93 resets) in 237 ms. (168 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (230 resets) in 169 ms. (235 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (89 resets) in 231 ms. (172 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (241 resets) in 108 ms. (366 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (91 resets) in 204 ms. (195 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (252 resets) in 109 ms. (363 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (94 resets) in 160 ms. (248 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (248 resets) in 136 ms. (292 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (84 resets) in 143 ms. (277 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (248 resets) in 212 ms. (187 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (230 resets) in 213 ms. (186 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (243 resets) in 164 ms. (242 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (230 resets) in 119 ms. (333 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (244 resets) in 104 ms. (380 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (225 resets) in 156 ms. (254 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (238 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (91 resets) in 145 ms. (273 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (91 resets) in 108 ms. (367 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (90 resets) in 165 ms. (240 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (236 resets) in 214 ms. (186 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (249 resets) in 131 ms. (303 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (236 resets) in 181 ms. (219 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (239 resets) in 148 ms. (268 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (249 resets) in 98 ms. (404 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (251 resets) in 120 ms. (330 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (249 resets) in 156 ms. (254 steps per ms) remains 121/121 properties
Interrupted probabilistic random walk after 4214447 steps, run timeout after 51001 ms. (steps per millisecond=82 ) properties seen :0 out of 121
Probabilistic random walk after 4214447 steps, saw 1378571 distinct states, run finished after 51001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-02 21:25:59] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
// Phase 1: matrix 630 rows 229 cols
[2024-06-02 21:25:59] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 21:25:59] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 135/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:26:00] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:26:00] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-06-02 21:26:00] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:26:00] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:26:01] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2024-06-02 21:26:01] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 6/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 630/848 variables, 218/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 73/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 11/859 variables, 11/318 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 318 constraints, problems are : Problem set: 0 solved, 121 unsolved in 13211 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 135/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 6/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:26:14] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 630/848 variables, 218/235 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 73/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 117/425 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 11/859 variables, 11/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:26:31] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/859 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/859 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (OVERLAPS) 0/859 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 441 constraints, problems are : Problem set: 0 solved, 121 unsolved in 44244 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 57585ms problems are : Problem set: 0 solved, 121 unsolved
Parikh walk visited 0 properties in 25099 ms.
Support contains 77 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 641/641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 229/229 places, 641/641 transitions.
RANDOM walk for 4000000 steps (124584 resets) in 56689 ms. (70 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (92 resets) in 128 ms. (310 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (242 resets) in 176 ms. (226 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (92 resets) in 91 ms. (434 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (235 resets) in 189 ms. (210 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (89 resets) in 187 ms. (212 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (243 resets) in 179 ms. (222 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (92 resets) in 203 ms. (196 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (245 resets) in 146 ms. (272 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (91 resets) in 190 ms. (209 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (250 resets) in 88 ms. (449 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (87 resets) in 210 ms. (189 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (232 resets) in 134 ms. (296 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (250 resets) in 109 ms. (363 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (92 resets) in 142 ms. (279 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (238 resets) in 117 ms. (339 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (91 resets) in 202 ms. (197 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (238 resets) in 184 ms. (216 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (88 resets) in 168 ms. (236 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (233 resets) in 131 ms. (303 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (83 resets) in 159 ms. (250 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (237 resets) in 159 ms. (250 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (93 resets) in 155 ms. (256 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (246 resets) in 175 ms. (227 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (252 resets) in 89 ms. (444 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (90 resets) in 178 ms. (223 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (251 resets) in 84 ms. (470 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (87 resets) in 129 ms. (307 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (233 resets) in 182 ms. (218 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (94 resets) in 125 ms. (317 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (234 resets) in 189 ms. (210 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (91 resets) in 164 ms. (242 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (234 resets) in 110 ms. (360 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (92 resets) in 106 ms. (373 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (235 resets) in 82 ms. (481 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (234 resets) in 130 ms. (305 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (250 resets) in 176 ms. (226 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (241 resets) in 165 ms. (240 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (240 resets) in 142 ms. (279 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (229 resets) in 81 ms. (487 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (229 resets) in 157 ms. (253 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (94 resets) in 150 ms. (264 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (92 resets) in 166 ms. (239 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (90 resets) in 129 ms. (307 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (241 resets) in 199 ms. (200 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (242 resets) in 141 ms. (281 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (235 resets) in 125 ms. (317 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (233 resets) in 135 ms. (294 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (260 resets) in 142 ms. (279 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (231 resets) in 150 ms. (264 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (247 resets) in 120 ms. (330 steps per ms) remains 121/121 properties
Interrupted probabilistic random walk after 4109921 steps, run timeout after 51001 ms. (steps per millisecond=80 ) properties seen :0 out of 121
Probabilistic random walk after 4109921 steps, saw 1342116 distinct states, run finished after 51001 ms. (steps per millisecond=80 ) properties seen :0
[2024-06-02 21:28:31] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:28:31] [INFO ] Invariant cache hit.
[2024-06-02 21:28:31] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 135/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:28:32] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:28:32] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:28:32] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:28:32] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:28:32] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2024-06-02 21:28:33] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 6/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:28:34] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 630/848 variables, 218/235 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 73/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 11/859 variables, 11/319 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/859 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/859 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 319 constraints, problems are : Problem set: 0 solved, 121 unsolved in 14141 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 135/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 6/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 630/848 variables, 218/235 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 73/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 117/425 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:28:49] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 11/859 variables, 11/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/859 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/859 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (OVERLAPS) 0/859 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 441 constraints, problems are : Problem set: 0 solved, 121 unsolved in 34242 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 48503ms problems are : Problem set: 0 solved, 121 unsolved
Parikh walk visited 0 properties in 13910 ms.
Support contains 77 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Applied a total of 0 rules in 24 ms. Remains 229 /229 variables (removed 0) and now considering 641/641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 229/229 places, 641/641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Applied a total of 0 rules in 11 ms. Remains 229 /229 variables (removed 0) and now considering 641/641 (removed 0) transitions.
[2024-06-02 21:29:33] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:29:33] [INFO ] Invariant cache hit.
[2024-06-02 21:29:34] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:29:34] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:29:34] [INFO ] Invariant cache hit.
[2024-06-02 21:29:34] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 21:29:34] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-06-02 21:29:34] [INFO ] Redundant transitions in 32 ms returned []
Running 633 sub problems to find dead transitions.
[2024-06-02 21:29:34] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:29:34] [INFO ] Invariant cache hit.
[2024-06-02 21:29:34] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 633 unsolved
[2024-06-02 21:29:40] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:29:40] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:29:40] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:29:40] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:29:41] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 1 ms to minimize.
[2024-06-02 21:29:41] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:29:41] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:29:41] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:29:42] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:29:42] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:29:43] [INFO ] Deduced a trap composed of 161 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 633 unsolved
[2024-06-02 21:29:46] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 633 unsolved
[2024-06-02 21:29:53] [INFO ] Deduced a trap composed of 172 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 6 (OVERLAPS) 630/859 variables, 229/252 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 73/325 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 859/859 variables, and 325 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 633 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 4 (OVERLAPS) 630/859 variables, 229/252 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/859 variables, 73/325 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/859 variables, 633/958 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/859 variables, and 958 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 13/13 constraints]
After SMT, in 60833ms problems are : Problem set: 0 solved, 633 unsolved
Search for dead transitions found 0 dead transitions in 60839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61335 ms. Remains : 229/229 places, 641/641 transitions.
RANDOM walk for 400000 steps (12439 resets) in 6742 ms. (59 steps per ms) remains 58/77 properties
Running SMT prover for 58 properties.
[2024-06-02 21:30:37] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:30:37] [INFO ] Invariant cache hit.
[2024-06-02 21:30:37] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:30:37] [INFO ] After 189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :58
[2024-06-02 21:30:37] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 21:30:37] [INFO ] After 126ms SMT Verify possible using 73 Read/Feed constraints in real domain returned unsat :0 sat :58
TRAPS : Iteration 0
[2024-06-02 21:30:39] [INFO ] After 1909ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:58
[2024-06-02 21:30:39] [INFO ] After 2201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:58
[2024-06-02 21:30:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:30:39] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :58
[2024-06-02 21:30:39] [INFO ] After 150ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :58
TRAPS : Iteration 0
[2024-06-02 21:30:39] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:30:39] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:30:40] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 0 ms to minimize.
[2024-06-02 21:30:40] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:30:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 354 ms
TRAPS : Iteration 1
[2024-06-02 21:30:43] [INFO ] After 4004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :58
[2024-06-02 21:30:43] [INFO ] After 4332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :58
RANDOM walk for 4000000 steps (124817 resets) in 60753 ms. (65 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (95 resets) in 169 ms. (235 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (248 resets) in 113 ms. (350 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (85 resets) in 80 ms. (493 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (237 resets) in 140 ms. (283 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (90 resets) in 128 ms. (310 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (230 resets) in 168 ms. (236 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (93 resets) in 119 ms. (333 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (238 resets) in 150 ms. (264 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (89 resets) in 154 ms. (258 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (231 resets) in 107 ms. (370 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (92 resets) in 192 ms. (207 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (243 resets) in 183 ms. (217 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (247 resets) in 158 ms. (251 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (91 resets) in 103 ms. (384 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (248 resets) in 196 ms. (203 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (92 resets) in 197 ms. (202 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (245 resets) in 182 ms. (218 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (90 resets) in 111 ms. (357 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (240 resets) in 159 ms. (250 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (90 resets) in 116 ms. (341 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (249 resets) in 107 ms. (370 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (92 resets) in 126 ms. (314 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (243 resets) in 132 ms. (300 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (231 resets) in 122 ms. (325 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (90 resets) in 175 ms. (227 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (241 resets) in 79 ms. (500 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (91 resets) in 204 ms. (195 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (243 resets) in 156 ms. (254 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (87 resets) in 135 ms. (294 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (251 resets) in 168 ms. (236 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (93 resets) in 137 ms. (289 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (239 resets) in 155 ms. (256 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (91 resets) in 81 ms. (487 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (242 resets) in 159 ms. (250 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (235 resets) in 116 ms. (341 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40001 steps (258 resets) in 100 ms. (396 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40002 steps (248 resets) in 106 ms. (373 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (233 resets) in 122 ms. (325 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (214 resets) in 99 ms. (400 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (238 resets) in 161 ms. (246 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (91 resets) in 122 ms. (325 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (93 resets) in 147 ms. (270 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (86 resets) in 118 ms. (336 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (231 resets) in 157 ms. (253 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (243 resets) in 114 ms. (347 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (223 resets) in 233 ms. (170 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (241 resets) in 210 ms. (189 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (249 resets) in 183 ms. (217 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40003 steps (240 resets) in 118 ms. (336 steps per ms) remains 121/121 properties
BEST_FIRST walk for 40004 steps (242 resets) in 155 ms. (256 steps per ms) remains 121/121 properties
Interrupted probabilistic random walk after 4646071 steps, run timeout after 54001 ms. (steps per millisecond=86 ) properties seen :0 out of 121
Probabilistic random walk after 4646071 steps, saw 1531166 distinct states, run finished after 54001 ms. (steps per millisecond=86 ) properties seen :0
[2024-06-02 21:31:56] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:31:56] [INFO ] Invariant cache hit.
[2024-06-02 21:31:56] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 135/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:31:58] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 6/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 630/848 variables, 218/235 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 73/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 11/859 variables, 11/319 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/859 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/859 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 319 constraints, problems are : Problem set: 0 solved, 121 unsolved in 13712 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 135/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 6/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 630/848 variables, 218/235 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 73/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 117/425 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 21:32:14] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 11/859 variables, 11/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/859 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/859 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (OVERLAPS) 0/859 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 441 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30782 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 44614ms problems are : Problem set: 0 solved, 121 unsolved
Parikh walk visited 0 properties in 14168 ms.
Support contains 77 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Applied a total of 0 rules in 8 ms. Remains 229 /229 variables (removed 0) and now considering 641/641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 229/229 places, 641/641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Applied a total of 0 rules in 7 ms. Remains 229 /229 variables (removed 0) and now considering 641/641 (removed 0) transitions.
[2024-06-02 21:32:55] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:32:55] [INFO ] Invariant cache hit.
[2024-06-02 21:32:55] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 21:32:55] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:32:55] [INFO ] Invariant cache hit.
[2024-06-02 21:32:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 21:32:55] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-06-02 21:32:55] [INFO ] Redundant transitions in 8 ms returned []
Running 633 sub problems to find dead transitions.
[2024-06-02 21:32:55] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:32:55] [INFO ] Invariant cache hit.
[2024-06-02 21:32:55] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 633 unsolved
[2024-06-02 21:33:01] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-06-02 21:33:01] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:33:01] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
[2024-06-02 21:33:02] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2024-06-02 21:33:02] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 1 ms to minimize.
[2024-06-02 21:33:02] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:33:04] [INFO ] Deduced a trap composed of 161 places in 120 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 633 unsolved
[2024-06-02 21:33:07] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 633 unsolved
[2024-06-02 21:33:14] [INFO ] Deduced a trap composed of 172 places in 107 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 6 (OVERLAPS) 630/859 variables, 229/252 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 73/325 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 859/859 variables, and 325 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 633 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 4 (OVERLAPS) 630/859 variables, 229/252 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/859 variables, 73/325 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/859 variables, 633/958 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/859 variables, and 958 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 13/13 constraints]
After SMT, in 60756ms problems are : Problem set: 0 solved, 633 unsolved
Search for dead transitions found 0 dead transitions in 60763ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61208 ms. Remains : 229/229 places, 641/641 transitions.
RANDOM walk for 400000 steps (12418 resets) in 3956 ms. (101 steps per ms) remains 59/77 properties
Running SMT prover for 59 properties.
[2024-06-02 21:33:57] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:33:57] [INFO ] Invariant cache hit.
[2024-06-02 21:33:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:33:57] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :59
[2024-06-02 21:33:57] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 21:33:58] [INFO ] After 127ms SMT Verify possible using 73 Read/Feed constraints in real domain returned unsat :0 sat :59
TRAPS : Iteration 0
[2024-06-02 21:33:59] [INFO ] After 1875ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:59
[2024-06-02 21:33:59] [INFO ] After 2109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:59
[2024-06-02 21:33:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:34:00] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :59
[2024-06-02 21:34:00] [INFO ] After 164ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :59
TRAPS : Iteration 0
[2024-06-02 21:34:00] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:34:00] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2024-06-02 21:34:01] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:34:01] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:34:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
TRAPS : Iteration 1
[2024-06-02 21:34:04] [INFO ] After 4035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :59
[2024-06-02 21:34:04] [INFO ] After 4362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :59
RANDOM walk for 219 steps (9 resets) in 6 ms. (31 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1248 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (234 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 889779 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 1
Probabilistic random walk after 889779 steps, saw 291990 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
[2024-06-02 21:34:07] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
[2024-06-02 21:34:07] [INFO ] Invariant cache hit.
[2024-06-02 21:34:07] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:34:07] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:34:07] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 630/844 variables, 214/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 73/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/859 variables, 15/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:34:07] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:34:07] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:34:07] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 630/844 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 73/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/859 variables, 15/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/859 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 818ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 214 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 211 transition count 602
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 209 transition count 598
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 209 transition count 598
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 207 transition count 592
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 207 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 205 transition count 588
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 205 transition count 588
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 203 transition count 582
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 203 transition count 582
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 201 transition count 578
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 201 transition count 578
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 199 transition count 572
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 199 transition count 572
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 197 transition count 568
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 197 transition count 568
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 195 transition count 562
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 195 transition count 562
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 193 transition count 558
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 193 transition count 558
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 191 transition count 554
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 191 transition count 554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 189 transition count 550
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 189 transition count 550
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 189 transition count 548
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 89 place count 189 transition count 541
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 96 place count 182 transition count 541
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 178 transition count 537
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 178 transition count 537
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 107 place count 178 transition count 534
Applied a total of 107 rules in 86 ms. Remains 178 /229 variables (removed 51) and now considering 534/641 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 178/229 places, 534/641 transitions.
RANDOM walk for 40000 steps (1326 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (249 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1099873 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :0 out of 1
Probabilistic random walk after 1099873 steps, saw 309207 distinct states, run finished after 3002 ms. (steps per millisecond=366 ) properties seen :0
[2024-06-02 21:34:11] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
// Phase 1: matrix 523 rows 178 cols
[2024-06-02 21:34:11] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:34:11] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:34:11] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 523/689 variables, 166/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 98/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/701 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/701 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/701 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:34:11] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:34:11] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 523/689 variables, 166/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 98/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/701 variables, 12/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/701 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 701/701 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 534/534 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 178/178 places, 534/534 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 534/534 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2024-06-02 21:34:11] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
[2024-06-02 21:34:11] [INFO ] Invariant cache hit.
[2024-06-02 21:34:12] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 21:34:12] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
[2024-06-02 21:34:12] [INFO ] Invariant cache hit.
[2024-06-02 21:34:12] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:34:12] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-06-02 21:34:12] [INFO ] Redundant transitions in 3 ms returned []
Running 526 sub problems to find dead transitions.
[2024-06-02 21:34:12] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
[2024-06-02 21:34:12] [INFO ] Invariant cache hit.
[2024-06-02 21:34:12] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-02 21:34:16] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:34:16] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:34:17] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:34:17] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:34:17] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:34:17] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:34:18] [INFO ] Deduced a trap composed of 122 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (OVERLAPS) 523/701 variables, 178/195 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 98/293 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 7 (OVERLAPS) 0/701 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 526 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 293 constraints, problems are : Problem set: 0 solved, 526 unsolved in 21866 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 526 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-02 21:34:37] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:34:37] [INFO ] Deduced a trap composed of 132 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 5 (OVERLAPS) 523/701 variables, 178/197 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 98/295 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 526/821 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 821 constraints, problems are : Problem set: 0 solved, 526 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 9/9 constraints]
After SMT, in 52432ms problems are : Problem set: 0 solved, 526 unsolved
Search for dead transitions found 0 dead transitions in 52436ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52986 ms. Remains : 178/178 places, 534/534 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 119 edges and 178 vertex of which 29 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 356
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 356
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 150 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 149 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 149 transition count 313
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 149 transition count 307
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 143 transition count 304
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 143 transition count 301
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 140 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 139 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 139 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 138 transition count 298
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 137 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 137 transition count 260
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 137 transition count 257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 134 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 134 transition count 251
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 134 transition count 248
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 131 transition count 248
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 131 transition count 248
Applied a total of 103 rules in 75 ms. Remains 131 /178 variables (removed 47) and now considering 248/534 (removed 286) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:35:05] [INFO ] Flow matrix only has 244 transitions (discarded 4 similar events)
// Phase 1: matrix 244 rows 131 cols
[2024-06-02 21:35:05] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:35:05] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 21:35:05] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:35:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:35:05] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:35:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:35:05] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:35:05] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:35:05] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 291 ms.
RANDOM walk for 348 steps (7 resets) in 5 ms. (58 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1246 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (245 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 908989 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :0 out of 1
Probabilistic random walk after 908989 steps, saw 296314 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
[2024-06-02 21:35:08] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
// Phase 1: matrix 630 rows 229 cols
[2024-06-02 21:35:08] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:35:08] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:35:08] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:35:08] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:35:08] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 630/844 variables, 214/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 73/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/859 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:35:08] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 630/844 variables, 214/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 73/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/859 variables, 15/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 756ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 214 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 208 transition count 596
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 206 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 206 transition count 590
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 204 transition count 586
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 204 transition count 586
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 202 transition count 580
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 202 transition count 580
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 200 transition count 576
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 200 transition count 576
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 198 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 198 transition count 570
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 196 transition count 566
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 196 transition count 566
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 194 transition count 560
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 194 transition count 560
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 192 transition count 556
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 192 transition count 556
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 190 transition count 552
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 190 transition count 552
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 188 transition count 548
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 188 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 188 transition count 546
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 91 place count 188 transition count 539
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 98 place count 181 transition count 539
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 177 transition count 535
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 177 transition count 535
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 177 transition count 532
Applied a total of 109 rules in 64 ms. Remains 177 /229 variables (removed 52) and now considering 532/641 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 177/229 places, 532/641 transitions.
RANDOM walk for 40000 steps (1361 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1082226 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 1
Probabilistic random walk after 1082226 steps, saw 304086 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
[2024-06-02 21:35:12] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
// Phase 1: matrix 521 rows 177 cols
[2024-06-02 21:35:12] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:35:12] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:35:12] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:35:12] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 521/686 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 98/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/686 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/698 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/698 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 98/98 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:35:12] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:35:12] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 521/686 variables, 165/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/686 variables, 98/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/686 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/698 variables, 12/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/698 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 698/698 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 718ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 532/532 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 177/177 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 532/532 transitions.
Applied a total of 0 rules in 6 ms. Remains 177 /177 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2024-06-02 21:35:12] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
[2024-06-02 21:35:12] [INFO ] Invariant cache hit.
[2024-06-02 21:35:13] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 21:35:13] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
[2024-06-02 21:35:13] [INFO ] Invariant cache hit.
[2024-06-02 21:35:13] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:35:13] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-06-02 21:35:13] [INFO ] Redundant transitions in 6 ms returned []
Running 524 sub problems to find dead transitions.
[2024-06-02 21:35:13] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
[2024-06-02 21:35:13] [INFO ] Invariant cache hit.
[2024-06-02 21:35:13] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-02 21:35:17] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:35:17] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:35:17] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:35:18] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:35:18] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:35:18] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:35:18] [INFO ] Deduced a trap composed of 122 places in 88 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 521/698 variables, 177/194 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 98/292 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (OVERLAPS) 0/698 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 292 constraints, problems are : Problem set: 0 solved, 524 unsolved in 20561 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 521/698 variables, 177/194 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 98/292 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 524/816 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/698 variables, and 816 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 7/7 constraints]
After SMT, in 51248ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 51255ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51765 ms. Remains : 177/177 places, 532/532 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 119 edges and 177 vertex of which 29 / 177 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 149 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 149 transition count 354
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 149 transition count 339
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 148 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 148 transition count 311
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 148 transition count 305
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 142 transition count 302
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 142 transition count 299
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 139 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 138 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 138 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 137 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 136 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 136 transition count 258
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 136 transition count 255
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 133 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 133 transition count 249
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 133 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 130 transition count 246
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 130 transition count 246
Applied a total of 103 rules in 44 ms. Remains 130 /177 variables (removed 47) and now considering 246/532 (removed 286) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:36:04] [INFO ] Flow matrix only has 242 transitions (discarded 4 similar events)
// Phase 1: matrix 242 rows 130 cols
[2024-06-02 21:36:04] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:36:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:36:04] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:36:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:36:04] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:36:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:36:04] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:36:04] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:36:04] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
RANDOM walk for 40000 steps (1241 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (233 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 831285 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :0 out of 1
Probabilistic random walk after 831285 steps, saw 273836 distinct states, run finished after 3003 ms. (steps per millisecond=276 ) properties seen :0
[2024-06-02 21:36:07] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
// Phase 1: matrix 630 rows 229 cols
[2024-06-02 21:36:08] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:36:08] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:36:08] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:36:08] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:36:08] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 630/844 variables, 214/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 73/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/859 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:36:08] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 630/844 variables, 214/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 73/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/859 variables, 15/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 214 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 208 transition count 596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 205 transition count 587
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 205 transition count 587
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 203 transition count 583
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 203 transition count 583
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 201 transition count 577
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 201 transition count 577
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 199 transition count 573
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 199 transition count 573
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 197 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 197 transition count 567
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 195 transition count 563
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 195 transition count 563
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 193 transition count 557
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 193 transition count 557
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 191 transition count 553
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 191 transition count 553
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 189 transition count 549
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 189 transition count 549
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 187 transition count 545
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 187 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 187 transition count 543
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 93 place count 187 transition count 536
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 100 place count 180 transition count 536
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 176 transition count 532
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 176 transition count 532
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 176 transition count 529
Applied a total of 111 rules in 63 ms. Remains 176 /229 variables (removed 53) and now considering 529/641 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 176/229 places, 529/641 transitions.
RANDOM walk for 40000 steps (1331 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (268 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1187958 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 1
Probabilistic random walk after 1187958 steps, saw 339183 distinct states, run finished after 3001 ms. (steps per millisecond=395 ) properties seen :0
[2024-06-02 21:36:11] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
// Phase 1: matrix 518 rows 176 cols
[2024-06-02 21:36:11] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:36:11] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:36:11] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 518/682 variables, 164/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/682 variables, 97/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/694 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/694 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:36:12] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:36:12] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 518/682 variables, 164/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 97/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/682 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/694 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/694 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 694/694 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 529/529 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 176/176 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 529/529 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-06-02 21:36:12] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
[2024-06-02 21:36:12] [INFO ] Invariant cache hit.
[2024-06-02 21:36:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 21:36:12] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
[2024-06-02 21:36:12] [INFO ] Invariant cache hit.
[2024-06-02 21:36:12] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-02 21:36:12] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-06-02 21:36:12] [INFO ] Redundant transitions in 6 ms returned []
Running 521 sub problems to find dead transitions.
[2024-06-02 21:36:12] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
[2024-06-02 21:36:12] [INFO ] Invariant cache hit.
[2024-06-02 21:36:12] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-02 21:36:16] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:36:16] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:36:16] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:36:16] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:36:17] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:36:17] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:36:17] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:36:17] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:36:18] [INFO ] Deduced a trap composed of 122 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:36:18] [INFO ] Deduced a trap composed of 130 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (OVERLAPS) 518/694 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 97/293 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 7 (OVERLAPS) 0/694 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 521 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 293 constraints, problems are : Problem set: 0 solved, 521 unsolved in 20119 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-02 21:36:35] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (OVERLAPS) 518/694 variables, 176/197 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 97/294 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/694 variables, 521/815 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 694/694 variables, and 815 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 11/11 constraints]
After SMT, in 50712ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 50716ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51168 ms. Remains : 176/176 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 118 edges and 176 vertex of which 29 / 176 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 148 transition count 351
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 148 transition count 351
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 148 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 147 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 147 transition count 308
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 147 transition count 302
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 141 transition count 299
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 141 transition count 296
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 138 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 137 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 137 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 136 transition count 293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 135 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 135 transition count 256
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 135 transition count 253
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 132 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 132 transition count 247
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 132 transition count 244
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 129 transition count 244
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 129 transition count 244
Applied a total of 103 rules in 38 ms. Remains 129 /176 variables (removed 47) and now considering 244/529 (removed 285) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:37:03] [INFO ] Flow matrix only has 240 transitions (discarded 4 similar events)
// Phase 1: matrix 240 rows 129 cols
[2024-06-02 21:37:03] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:37:03] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:37:03] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:37:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:37:03] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:37:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:37:03] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:37:03] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:37:03] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 240 ms.
RANDOM walk for 40000 steps (1244 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (231 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 817087 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 817087 steps, saw 269294 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2024-06-02 21:37:06] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
// Phase 1: matrix 630 rows 229 cols
[2024-06-02 21:37:06] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:37:06] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:37:07] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:37:07] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 0 ms to minimize.
[2024-06-02 21:37:07] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 630/844 variables, 214/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 73/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/859 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:37:07] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 630/844 variables, 214/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 73/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/859 variables, 15/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 722ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 214 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 208 transition count 596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 205 transition count 587
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 205 transition count 587
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 202 transition count 581
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 202 transition count 581
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 200 transition count 575
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 200 transition count 575
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 198 transition count 571
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 198 transition count 571
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 196 transition count 565
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 196 transition count 565
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 194 transition count 561
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 194 transition count 561
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 192 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 192 transition count 555
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 190 transition count 551
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 190 transition count 551
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 188 transition count 547
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 188 transition count 547
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 186 transition count 543
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 186 transition count 543
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 186 transition count 541
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 95 place count 186 transition count 534
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 102 place count 179 transition count 534
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 175 transition count 530
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 175 transition count 530
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 175 transition count 527
Applied a total of 113 rules in 45 ms. Remains 175 /229 variables (removed 54) and now considering 527/641 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 175/229 places, 527/641 transitions.
RANDOM walk for 40000 steps (1298 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (276 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1101374 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1101374 steps, saw 309423 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
[2024-06-02 21:37:10] [INFO ] Flow matrix only has 516 transitions (discarded 11 similar events)
// Phase 1: matrix 516 rows 175 cols
[2024-06-02 21:37:10] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:37:10] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:37:10] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:37:10] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 516/679 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/679 variables, 97/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/679 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/691 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/691 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 691/691 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 97/97 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:37:11] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 516/679 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/679 variables, 97/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/679 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/691 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/691 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/691 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 691/691 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 566ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 527/527 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 527/527 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 175/175 places, 527/527 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 527/527 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-06-02 21:37:11] [INFO ] Flow matrix only has 516 transitions (discarded 11 similar events)
[2024-06-02 21:37:11] [INFO ] Invariant cache hit.
[2024-06-02 21:37:11] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 21:37:11] [INFO ] Flow matrix only has 516 transitions (discarded 11 similar events)
[2024-06-02 21:37:11] [INFO ] Invariant cache hit.
[2024-06-02 21:37:11] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-02 21:37:11] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-06-02 21:37:11] [INFO ] Redundant transitions in 5 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-02 21:37:11] [INFO ] Flow matrix only has 516 transitions (discarded 11 similar events)
[2024-06-02 21:37:11] [INFO ] Invariant cache hit.
[2024-06-02 21:37:11] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-02 21:37:15] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:37:15] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:37:15] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:37:16] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:37:16] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-06-02 21:37:16] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:37:16] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:37:17] [INFO ] Deduced a trap composed of 122 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-02 21:37:19] [INFO ] Deduced a trap composed of 129 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 516/691 variables, 175/194 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 97/291 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (OVERLAPS) 0/691 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 519 unsolved
No progress, stopping.
After SMT solving in domain Real declared 691/691 variables, and 291 constraints, problems are : Problem set: 0 solved, 519 unsolved in 22542 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-02 21:37:37] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 516/691 variables, 175/195 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 97/292 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 519/811 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/691 variables, and 811 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 10/10 constraints]
After SMT, in 53116ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 53123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53666 ms. Remains : 175/175 places, 527/527 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 118 edges and 175 vertex of which 29 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 147 transition count 349
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 147 transition count 349
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 147 transition count 334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 146 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 146 transition count 306
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 146 transition count 300
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 140 transition count 297
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 140 transition count 294
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 137 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 136 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 136 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 135 transition count 291
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 134 transition count 254
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 134 transition count 254
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 134 transition count 251
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 131 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 131 transition count 245
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 131 transition count 242
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 128 transition count 242
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 128 transition count 242
Applied a total of 103 rules in 43 ms. Remains 128 /175 variables (removed 47) and now considering 242/527 (removed 285) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:38:04] [INFO ] Flow matrix only has 238 transitions (discarded 4 similar events)
// Phase 1: matrix 238 rows 128 cols
[2024-06-02 21:38:04] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:38:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:38:05] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:38:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-02 21:38:05] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:38:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:38:05] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:38:05] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:38:05] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 256 ms.
RANDOM walk for 40000 steps (1264 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (241 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 886218 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 886218 steps, saw 290950 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2024-06-02 21:38:08] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
// Phase 1: matrix 630 rows 229 cols
[2024-06-02 21:38:08] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 21:38:08] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:38:08] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:38:08] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:38:08] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 630/844 variables, 214/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 73/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/859 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:38:08] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 630/844 variables, 214/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 73/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/859 variables, 15/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 214 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 208 transition count 596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 205 transition count 587
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 205 transition count 587
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 202 transition count 581
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 202 transition count 581
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 199 transition count 572
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 199 transition count 572
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 197 transition count 568
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 197 transition count 568
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 195 transition count 562
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 195 transition count 562
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 193 transition count 558
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 193 transition count 558
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 191 transition count 552
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 191 transition count 552
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 189 transition count 548
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 189 transition count 548
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 187 transition count 544
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 187 transition count 544
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 185 transition count 540
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 185 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 185 transition count 538
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 97 place count 185 transition count 531
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 104 place count 178 transition count 531
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 174 transition count 527
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 174 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 115 place count 174 transition count 524
Applied a total of 115 rules in 50 ms. Remains 174 /229 variables (removed 55) and now considering 524/641 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 174/229 places, 524/641 transitions.
RANDOM walk for 40000 steps (1296 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (253 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1180695 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :0 out of 1
Probabilistic random walk after 1180695 steps, saw 337191 distinct states, run finished after 3001 ms. (steps per millisecond=393 ) properties seen :0
[2024-06-02 21:38:12] [INFO ] Flow matrix only has 513 transitions (discarded 11 similar events)
// Phase 1: matrix 513 rows 174 cols
[2024-06-02 21:38:12] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:38:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:38:12] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:38:12] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 513/675 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 96/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/687 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/687 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/687 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 687/687 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 96/96 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 513/675 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 96/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/687 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/687 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/687 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 687/687 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 518ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 524/524 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 524/524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 174/174 places, 524/524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 524/524 transitions.
Applied a total of 0 rules in 8 ms. Remains 174 /174 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-06-02 21:38:12] [INFO ] Flow matrix only has 513 transitions (discarded 11 similar events)
[2024-06-02 21:38:12] [INFO ] Invariant cache hit.
[2024-06-02 21:38:12] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:38:12] [INFO ] Flow matrix only has 513 transitions (discarded 11 similar events)
[2024-06-02 21:38:12] [INFO ] Invariant cache hit.
[2024-06-02 21:38:12] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-02 21:38:13] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-06-02 21:38:13] [INFO ] Redundant transitions in 4 ms returned []
Running 516 sub problems to find dead transitions.
[2024-06-02 21:38:13] [INFO ] Flow matrix only has 513 transitions (discarded 11 similar events)
[2024-06-02 21:38:13] [INFO ] Invariant cache hit.
[2024-06-02 21:38:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 21:38:16] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:38:16] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:38:17] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:38:17] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:38:17] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:38:17] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:38:17] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:38:18] [INFO ] Deduced a trap composed of 122 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:38:18] [INFO ] Deduced a trap composed of 128 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 513/687 variables, 174/193 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/687 variables, 96/289 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 21:38:25] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/687 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/687 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 8 (OVERLAPS) 0/687 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 516 unsolved
No progress, stopping.
After SMT solving in domain Real declared 687/687 variables, and 290 constraints, problems are : Problem set: 0 solved, 516 unsolved in 24228 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 513/687 variables, 174/194 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/687 variables, 96/290 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/687 variables, 516/806 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/687 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 687/687 variables, and 806 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 10/10 constraints]
After SMT, in 54872ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 54877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55362 ms. Remains : 174/174 places, 524/524 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 117 edges and 174 vertex of which 29 / 174 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 146 transition count 346
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 146 transition count 346
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 146 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 145 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 145 transition count 303
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 145 transition count 297
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 139 transition count 294
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 139 transition count 291
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 136 transition count 291
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 135 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 135 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 134 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 133 transition count 252
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 133 transition count 252
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 133 transition count 249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 130 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 130 transition count 243
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 130 transition count 240
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 127 transition count 240
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 127 transition count 240
Applied a total of 103 rules in 36 ms. Remains 127 /174 variables (removed 47) and now considering 240/524 (removed 284) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:39:08] [INFO ] Flow matrix only has 236 transitions (discarded 4 similar events)
// Phase 1: matrix 236 rows 127 cols
[2024-06-02 21:39:08] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:39:08] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:39:08] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:39:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:39:08] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:39:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:39:08] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:39:08] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:39:08] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:39:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
TRAPS : Iteration 1
[2024-06-02 21:39:08] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:39:08] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 468 ms.
RANDOM walk for 40000 steps (1283 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (240 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 879413 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 1
Probabilistic random walk after 879413 steps, saw 289213 distinct states, run finished after 3002 ms. (steps per millisecond=292 ) properties seen :0
[2024-06-02 21:39:11] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
// Phase 1: matrix 630 rows 229 cols
[2024-06-02 21:39:11] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 21:39:11] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:39:11] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:39:11] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:39:11] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 630/844 variables, 214/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 73/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/859 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:39:12] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 630/844 variables, 214/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 73/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/859 variables, 15/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 214 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 208 transition count 596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 205 transition count 587
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 205 transition count 587
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 202 transition count 581
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 202 transition count 581
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 199 transition count 572
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 199 transition count 572
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 196 transition count 566
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 196 transition count 566
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 194 transition count 560
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 194 transition count 560
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 192 transition count 556
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 192 transition count 556
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 190 transition count 550
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 190 transition count 550
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 188 transition count 546
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 188 transition count 546
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 186 transition count 542
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 186 transition count 542
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 184 transition count 538
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 184 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 184 transition count 536
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 99 place count 184 transition count 529
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 106 place count 177 transition count 529
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 173 transition count 525
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 173 transition count 525
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 117 place count 173 transition count 522
Applied a total of 117 rules in 43 ms. Remains 173 /229 variables (removed 56) and now considering 522/641 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 173/229 places, 522/641 transitions.
RANDOM walk for 40000 steps (1355 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (262 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1212348 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 1
Probabilistic random walk after 1212348 steps, saw 345362 distinct states, run finished after 3002 ms. (steps per millisecond=403 ) properties seen :0
[2024-06-02 21:39:15] [INFO ] Flow matrix only has 511 transitions (discarded 11 similar events)
// Phase 1: matrix 511 rows 173 cols
[2024-06-02 21:39:15] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 21:39:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:39:15] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:39:15] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 511/672 variables, 161/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 96/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/684 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/684 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 684/684 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 96/96 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 511/672 variables, 161/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 96/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/684 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/684 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 684/684 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 522/522 transitions.
Applied a total of 0 rules in 6 ms. Remains 173 /173 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 173/173 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 522/522 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-02 21:39:15] [INFO ] Flow matrix only has 511 transitions (discarded 11 similar events)
[2024-06-02 21:39:15] [INFO ] Invariant cache hit.
[2024-06-02 21:39:15] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:39:15] [INFO ] Flow matrix only has 511 transitions (discarded 11 similar events)
[2024-06-02 21:39:15] [INFO ] Invariant cache hit.
[2024-06-02 21:39:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-02 21:39:16] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-06-02 21:39:16] [INFO ] Redundant transitions in 5 ms returned []
Running 514 sub problems to find dead transitions.
[2024-06-02 21:39:16] [INFO ] Flow matrix only has 511 transitions (discarded 11 similar events)
[2024-06-02 21:39:16] [INFO ] Invariant cache hit.
[2024-06-02 21:39:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-06-02 21:39:19] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:39:19] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:39:20] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:39:20] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:39:20] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:39:20] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:39:20] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:39:21] [INFO ] Deduced a trap composed of 122 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:39:21] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 4 (OVERLAPS) 511/684 variables, 173/192 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/684 variables, 96/288 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-06-02 21:39:28] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 8 (OVERLAPS) 0/684 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 514 unsolved
No progress, stopping.
After SMT solving in domain Real declared 684/684 variables, and 289 constraints, problems are : Problem set: 0 solved, 514 unsolved in 24793 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 514/514 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 514 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 4 (OVERLAPS) 511/684 variables, 173/193 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/684 variables, 96/289 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 514/803 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 684/684 variables, and 803 constraints, problems are : Problem set: 0 solved, 514 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 514/514 constraints, Known Traps: 10/10 constraints]
After SMT, in 55361ms problems are : Problem set: 0 solved, 514 unsolved
Search for dead transitions found 0 dead transitions in 55367ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55784 ms. Remains : 173/173 places, 522/522 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 117 edges and 173 vertex of which 29 / 173 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 145 transition count 344
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 145 transition count 344
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 145 transition count 329
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 144 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 144 transition count 301
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 144 transition count 295
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 138 transition count 292
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 138 transition count 289
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 72 place count 135 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 134 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 134 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 133 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 132 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 132 transition count 250
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 132 transition count 247
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 129 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 129 transition count 241
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 129 transition count 238
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 126 transition count 238
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 126 transition count 238
Applied a total of 103 rules in 42 ms. Remains 126 /173 variables (removed 47) and now considering 238/522 (removed 284) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:40:11] [INFO ] Flow matrix only has 234 transitions (discarded 4 similar events)
// Phase 1: matrix 234 rows 126 cols
[2024-06-02 21:40:11] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:40:11] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:40:11] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:40:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:40:11] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:40:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:40:11] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:40:11] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:40:11] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
RANDOM walk for 40000 steps (1211 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (251 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 813915 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :0 out of 1
Probabilistic random walk after 813915 steps, saw 268417 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
[2024-06-02 21:40:14] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
// Phase 1: matrix 630 rows 229 cols
[2024-06-02 21:40:14] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:40:14] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:40:14] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:40:14] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:40:15] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 630/844 variables, 214/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 73/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/859 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/214 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:40:15] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 630/844 variables, 214/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 73/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/859 variables, 15/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/859 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 214 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 208 transition count 596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 205 transition count 587
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 205 transition count 587
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 202 transition count 581
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 202 transition count 581
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 199 transition count 572
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 199 transition count 572
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 196 transition count 566
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 196 transition count 566
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 193 transition count 557
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 193 transition count 557
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 191 transition count 553
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 191 transition count 553
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 189 transition count 547
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 189 transition count 547
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 187 transition count 543
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 187 transition count 543
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 185 transition count 539
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 185 transition count 539
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 183 transition count 535
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 183 transition count 535
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 183 transition count 533
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 101 place count 183 transition count 526
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 108 place count 176 transition count 526
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 172 transition count 522
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 172 transition count 522
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 172 transition count 519
Applied a total of 119 rules in 48 ms. Remains 172 /229 variables (removed 57) and now considering 519/641 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 172/229 places, 519/641 transitions.
RANDOM walk for 40000 steps (1342 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (262 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1113013 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :0 out of 1
Probabilistic random walk after 1113013 steps, saw 313459 distinct states, run finished after 3001 ms. (steps per millisecond=370 ) properties seen :0
[2024-06-02 21:40:18] [INFO ] Flow matrix only has 508 transitions (discarded 11 similar events)
// Phase 1: matrix 508 rows 172 cols
[2024-06-02 21:40:18] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:40:18] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:40:18] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:40:18] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:40:18] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:40:18] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 508/668 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 95/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/680 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/680 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/680 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 680/680 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 508/668 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 95/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/680 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/680 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/680 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 680/680 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 720ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 519/519 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 519/519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 172/172 places, 519/519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 519/519 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 519/519 (removed 0) transitions.
[2024-06-02 21:40:19] [INFO ] Flow matrix only has 508 transitions (discarded 11 similar events)
[2024-06-02 21:40:19] [INFO ] Invariant cache hit.
[2024-06-02 21:40:19] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-02 21:40:19] [INFO ] Flow matrix only has 508 transitions (discarded 11 similar events)
[2024-06-02 21:40:19] [INFO ] Invariant cache hit.
[2024-06-02 21:40:19] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-02 21:40:19] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-06-02 21:40:19] [INFO ] Redundant transitions in 3 ms returned []
Running 511 sub problems to find dead transitions.
[2024-06-02 21:40:19] [INFO ] Flow matrix only has 508 transitions (discarded 11 similar events)
[2024-06-02 21:40:19] [INFO ] Invariant cache hit.
[2024-06-02 21:40:19] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 511 unsolved
[2024-06-02 21:40:23] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:40:23] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:40:25] [INFO ] Deduced a trap composed of 122 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:40:25] [INFO ] Deduced a trap composed of 126 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 4 (OVERLAPS) 508/680 variables, 172/192 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 95/287 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/680 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 7 (OVERLAPS) 0/680 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 511 unsolved
No progress, stopping.
After SMT solving in domain Real declared 680/680 variables, and 287 constraints, problems are : Problem set: 0 solved, 511 unsolved in 19425 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 511/511 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 4 (OVERLAPS) 508/680 variables, 172/192 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 95/287 constraints. Problems are: Problem set: 0 solved, 511 unsolved

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 QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is FireWire-PT-20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r564-tall-171734907800202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;