fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r056-tall-174854041500047
Last Updated
June 24, 2025

About the Execution of 2024-gold for CloudDeployment-PT-6b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15692.910 1800000.00 2609834.00 3336.60 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r056-tall-174854041500047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is CloudDeployment-PT-6b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tall-174854041500047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.8M May 29 14:32 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 1748644675195

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 22:37:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-30 22:37:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:37:57] [INFO ] Load time of PNML (sax parser for PT used): 459 ms
[2025-05-30 22:37:57] [INFO ] Transformed 1888 places.
[2025-05-30 22:37:57] [INFO ] Transformed 6804 transitions.
[2025-05-30 22:37:57] [INFO ] Found NUPN structural information;
[2025-05-30 22:37:57] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 647 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1908 edges and 1888 vertex of which 504 / 1888 are part of one of the 48 SCC in 12 ms
Free SCC test removed 456 places
Ensure Unique test removed 510 transitions
Reduce isomorphic transitions removed 510 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 682 transitions
Trivial Post-agglo rules discarded 682 transitions
Performed 682 trivial Post agglomeration. Transition count delta: 682
Iterating post reduction 0 with 689 rules applied. Total rules applied 690 place count 1425 transition count 5612
Reduce places removed 682 places and 0 transitions.
Iterating post reduction 1 with 682 rules applied. Total rules applied 1372 place count 743 transition count 5612
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 1372 place count 743 transition count 5588
Deduced a syphon composed of 24 places in 12 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 1420 place count 719 transition count 5588
Performed 432 Post agglomeration using F-continuation condition.Transition count delta: 432
Deduced a syphon composed of 432 places in 3 ms
Reduce places removed 432 places and 0 transitions.
Iterating global reduction 2 with 864 rules applied. Total rules applied 2284 place count 287 transition count 5156
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 2314 place count 287 transition count 5126
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 2362 place count 263 transition count 5180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2368 place count 263 transition count 5174
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 2380 place count 257 transition count 5234
Applied a total of 2380 rules in 482 ms. Remains 257 /1888 variables (removed 1631) and now considering 5234/6804 (removed 1570) transitions.
[2025-05-30 22:37:57] [INFO ] Flow matrix only has 5007 transitions (discarded 227 similar events)
// Phase 1: matrix 5007 rows 257 cols
[2025-05-30 22:37:57] [INFO ] Computed 18 invariants in 98 ms
[2025-05-30 22:38:03] [INFO ] Implicit Places using invariants in 6129 ms returned []
[2025-05-30 22:38:03] [INFO ] Flow matrix only has 5007 transitions (discarded 227 similar events)
[2025-05-30 22:38:03] [INFO ] Invariant cache hit.
[2025-05-30 22:38:05] [INFO ] State equation strengthened by 343 read => feed constraints.
[2025-05-30 22:38:22] [INFO ] Implicit Places using invariants and state equation in 19013 ms returned []
Implicit Place search using SMT with State Equation took 25175 ms to find 0 implicit places.
Running 5233 sub problems to find dead transitions.
[2025-05-30 22:38:22] [INFO ] Flow matrix only has 5007 transitions (discarded 227 similar events)
[2025-05-30 22:38:23] [INFO ] Invariant cache hit.
[2025-05-30 22:38:23] [INFO ] State equation strengthened by 343 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 5233 unsolved
SMT process timed out in 108173ms, After SMT, problems are : Problem set: 0 solved, 5233 unsolved
Search for dead transitions found 0 dead transitions in 108275ms
Starting structural reductions in LIVENESS mode, iteration 1 : 257/1888 places, 5234/6804 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 134015 ms. Remains : 257/1888 places, 5234/6804 transitions.
Discarding 778 transitions out of 5234. Remains 4456
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1002 resets) in 22688 ms. (1 steps per ms) remains 4263/4455 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 24 ms. (4 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 4263/4263 properties
Probabilistic random walk after 30001 steps, saw 7914 distinct states, run finished after 3279 ms. (steps per millisecond=9 ) properties seen :0
[2025-05-30 22:40:26] [INFO ] Flow matrix only has 5007 transitions (discarded 227 similar events)
[2025-05-30 22:40:26] [INFO ] Invariant cache hit.
[2025-05-30 22:40:26] [INFO ] State equation strengthened by 343 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 4263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/5264 variables, and 206 constraints, problems are : Problem set: 0 solved, 4263 unsolved in 5102 ms.
Refiners :[Domain max(s): 206/257 constraints, Generalized P Invariants (flows): 0/18 constraints, State Equation: 0/257 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 4263/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 4263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/5264 variables, and 206 constraints, problems are : Problem set: 0 solved, 4263 unsolved in 5059 ms.
Refiners :[Domain max(s): 206/257 constraints, Generalized P Invariants (flows): 0/18 constraints, State Equation: 0/257 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 4096/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 84558ms problems are : Problem set: 0 solved, 4263 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 206 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5234/5234 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 257 transition count 5186
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 257 transition count 5138
Applied a total of 96 rules in 193 ms. Remains 257 /257 variables (removed 0) and now considering 5138/5234 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 257/257 places, 5138/5234 transitions.
RANDOM walk for 470345 steps (11534 resets) in 120004 ms. (3 steps per ms) remains 4256/4263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 48 ms. (81 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (10 resets) in 75 ms. (52 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 76 ms. (52 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 88 ms. (44 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 65 ms. (60 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 94 ms. (42 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (11 resets) in 90 ms. (43 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 67 ms. (58 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (9 resets) in 79 ms. (50 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (12 resets) in 98 ms. (40 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 101 ms. (39 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 75 ms. (52 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (9 resets) in 82 ms. (48 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (11 resets) in 83 ms. (47 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (9 resets) in 67 ms. (58 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 133 ms. (29 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (11 resets) in 87 ms. (45 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 66 ms. (59 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 87 ms. (45 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (11 resets) in 93 ms. (42 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (12 resets) in 77 ms. (51 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 94 ms. (42 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 4256/4256 properties
Probabilistic random walk after 1000001 steps, saw 137050 distinct states, run finished after 57519 ms. (steps per millisecond=17 ) properties seen :0
[2025-05-30 22:43:20] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 22:43:20] [INFO ] Computed 18 invariants in 73 ms
[2025-05-30 22:43:20] [INFO ] State equation strengthened by 336 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
SMT process timed out in 121914ms, After SMT, problems are : Problem set: 0 solved, 4256 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 199 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Applied a total of 0 rules in 57 ms. Remains 257 /257 variables (removed 0) and now considering 5138/5138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 257/257 places, 5138/5138 transitions.
RANDOM walk for 493613 steps (12171 resets) in 120004 ms. (4 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 56 ms. (70 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 79 ms. (50 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (11 resets) in 63 ms. (62 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (9 resets) in 74 ms. (53 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4002 steps (8 resets) in 89 ms. (44 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 63 ms. (62 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (12 resets) in 105 ms. (37 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 70 ms. (56 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 87 ms. (45 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (10 resets) in 75 ms. (52 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (11 resets) in 90 ms. (44 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (12 resets) in 74 ms. (53 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 89 ms. (44 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (9 resets) in 56 ms. (70 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 84 ms. (47 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 95 ms. (41 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 64 ms. (61 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 93 ms. (42 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 70 ms. (56 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 79 ms. (50 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 98 ms. (40 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 66 ms. (59 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (11 resets) in 99 ms. (40 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 84 ms. (47 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 4256/4256 properties
Probabilistic random walk after 1000001 steps, saw 137050 distinct states, run finished after 54444 ms. (steps per millisecond=18 ) properties seen :0
[2025-05-30 22:46:48] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:46:48] [INFO ] Invariant cache hit.
[2025-05-30 22:46:48] [INFO ] State equation strengthened by 336 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 2 (OVERLAPS) 42/241 variables, 18/217 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 42/259 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/5215 variables, and 259 constraints, problems are : Problem set: 0 solved, 4256 unsolved in 75076 ms.
Refiners :[Domain max(s): 241/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/257 constraints, ReadFeed: 0/336 constraints, PredecessorRefiner: 4256/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 2 (OVERLAPS) 42/241 variables, 18/217 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 42/259 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 5 (OVERLAPS) 4958/5199 variables, 241/500 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 3)
(t1 0)
(t2 1)
(t3 1)
(t4 5)
(t5 1)
(t6 0)
(t7 1)
(t8 2)
(t9 1)
(t10 0)
(t11 2)
(t12 0)
(t13 0)
(t14 0)
(t15 1)
(t16 3)
(t17 5)
(t18 3)
(t19 1)
(t20 3)
(t21 1)
(t22 1)
(t23 5)
(t24 1)
(t25 0)
(t26 1)
(t27 2)
(t28 1)
(t29 0)
(t30 2)
(t31 0)
(t32 0)
(t33 0)
(t34 1)
(t35 7)
(t36 11)
(t37 3)
(t38 1)
(t39 7)
(t40 1)
(t41 1)
(t42 5)
(t43 1)
(t44 0)
(t45 1)
(t46 2)
(t47 1)
(t48 0)
(t49 2)
(t50 0)
(t51 0)
(t52 0)
(t53 0)
(t54 4)
(t55 6)
(t56 3)
(t57 0)
(t58 4)
(t59 1)
(t60 1)
(t61 5)
(t62 1)
(t63 0)
(t64 1)
(t65 2)
(t66 1)
(t67 0)
(t68 2)
(t69 0)
(t70 0)
(t71 0)
(t72 1)
(t73 4)
(t74 11)
(t75 3)
(t76 1)
(t77 4)
(t78 1)
(t79 1)
(t80 5)
(t81 1)
(t82 0)
(t83 1)
(t84 2)
(t85 1)
(t86 0)
(t87 2)
(t88 0)
(t89 0)
(t90 0)
(t91 1)
(t92 3)
(t93 5)
(t94 3)
(t95 1)
(t96 3)
(t97 1)
(t98 1)
(t99 5)
(t100 1)
(t101 0)
(t102 2)
(t103 2)
(t104 1)
(t105 0)
(t106 2)
(t107 0)
(t108 0)
(t109 0)
(t110 1)
(t111 3)
(t112 12)
(t113 3)
(t114 1)
(t115 3)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 0)
(t242 0)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 0)
(t356 0)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 0)
(t390 0)
(t391 0)
(t392 0)
(t393 0)
(t394 0)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 0)
(t401 0)
(t402 0)
(t403 0)
(t404 0)
(t405 0)
(t406 0)
(t407 0)
(t408 0)
(t409 0)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 0)
(t424 0)
(t425 0)
(t426 0)
(t427 0)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 0)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 0)
(t492 0)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 0)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 0)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 0)
(t513 0)
(t514 0)
(t515 0)
(t516 0)
(t517 0)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 0)
(t545 0)
(t546 0)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 0)
(t586 0)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 0)
(t594 0)
(t595 0)
(t596 0)
(t597 0)
(t598 0)
(t599 0)
(t600 0)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 0)
(t641 0)
(t642 0)
(t643 0)
(t644 0)
(t645 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 0)
(t651 0)
(t652 0)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 0)
(t673 0)
(t674 0)
(t675 0)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 0)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 0)
(t733 0)
(t734 0)
(t735 0)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 0)
(t745 0)
(t746 0)
(t747 0)
(t748 0)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 0)
(t758 0)
(t759 0)
(t760 0)
(t761 0)
(t762 0)
(t763 0)
(t764 0)
(t765 0)
(t766 0)
(t767 0)
(t768 0)
(t769 0)
(t770 0)
(t771 0)
(t772 0)
(t773 0)
(t774 0)
(t775 0)
(t776 0)
(t777 0)
(t778 0)
(t779 0)
(t780 0)
(t781 0)
(t782 0)
(t783 0)
(t784 0)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 0)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 0)
(t809 0)
(t810 0)
(t811 0)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 0)
(t822 0)
(t823 0)
(t824 0)
(t825 0)
(t826 0)
(t827 0)
(t828 0)
(t829 0)
(t830 0)
(t831 0)
(t832 0)
(t833 0)
(t834 0)
(t835 0)
(t836 0)
(t837 0)
(t838 timeout
0)
(t839 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 230809ms, After SMT, problems are : Problem set: 0 solved, 4256 unsolved
Fused 4256 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 359 ms.
Support contains 199 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Applied a total of 0 rules in 49 ms. Remains 257 /257 variables (removed 0) and now considering 5138/5138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 257/257 places, 5138/5138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Applied a total of 0 rules in 50 ms. Remains 257 /257 variables (removed 0) and now considering 5138/5138 (removed 0) transitions.
[2025-05-30 22:50:39] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:50:39] [INFO ] Invariant cache hit.
[2025-05-30 22:50:39] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 22:50:39] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:50:39] [INFO ] Invariant cache hit.
[2025-05-30 22:50:40] [INFO ] State equation strengthened by 336 read => feed constraints.
[2025-05-30 22:50:41] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
[2025-05-30 22:50:42] [INFO ] Redundant transitions in 1032 ms returned []
Running 5137 sub problems to find dead transitions.
[2025-05-30 22:50:42] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:50:42] [INFO ] Invariant cache hit.
[2025-05-30 22:50:42] [INFO ] State equation strengthened by 336 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 5137 unsolved
SMT process timed out in 118659ms, After SMT, problems are : Problem set: 0 solved, 5137 unsolved
Search for dead transitions found 0 dead transitions in 118712ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121552 ms. Remains : 257/257 places, 5138/5138 transitions.
RANDOM walk for 400000 steps (9865 resets) in 8679 ms. (46 steps per ms) remains 83/199 properties
Running SMT prover for 83 properties.
[2025-05-30 22:52:43] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:52:43] [INFO ] Invariant cache hit.
[2025-05-30 22:52:43] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 4 ms returned sat
SMT process timed out, exceeded limit of 100
[2025-05-30 22:52:45] [INFO ] After 1294ms SMT Verify possible using After timeout in real domain returned unsat :0 sat :83
[2025-05-30 22:52:45] [INFO ] After 1417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :83
RANDOM walk for 243713 steps (6002 resets) in 120004 ms. (2 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 48 ms. (81 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4002 steps (9 resets) in 112 ms. (35 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 56 ms. (70 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (10 resets) in 112 ms. (35 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 64 ms. (61 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (12 resets) in 125 ms. (31 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 121 ms. (32 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 78 ms. (50 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 74 ms. (53 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 121 ms. (32 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 110 ms. (36 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (9 resets) in 63 ms. (62 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 111 ms. (35 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 51 ms. (77 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 74 ms. (53 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 86 ms. (46 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (9 resets) in 80 ms. (49 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 84 ms. (47 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 85 ms. (46 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (10 resets) in 125 ms. (31 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4003 steps (9 resets) in 88 ms. (44 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 77 ms. (51 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (10 resets) in 109 ms. (36 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 52 ms. (75 steps per ms) remains 4256/4256 properties
BEST_FIRST walk for 4004 steps (9 resets) in 91 ms. (43 steps per ms) remains 4256/4256 properties
Probabilistic random walk after 1000001 steps, saw 137050 distinct states, run finished after 54297 ms. (steps per millisecond=18 ) properties seen :0
[2025-05-30 22:54:10] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:54:10] [INFO ] Invariant cache hit.
[2025-05-30 22:54:10] [INFO ] State equation strengthened by 336 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 2 (OVERLAPS) 42/241 variables, 18/217 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 42/259 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/5215 variables, and 259 constraints, problems are : Problem set: 0 solved, 4256 unsolved in 90087 ms.
Refiners :[Domain max(s): 241/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/257 constraints, ReadFeed: 0/336 constraints, PredecessorRefiner: 4256/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 2 (OVERLAPS) 42/241 variables, 18/217 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 42/259 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
At refinement iteration 5 (OVERLAPS) 4958/5199 variables, 241/500 constraints. Problems are: Problem set: 0 solved, 4256 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 268517ms, After SMT, problems are : Problem set: 0 solved, 4256 unsolved
Fused 4256 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 640 ms.
Support contains 199 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Applied a total of 0 rules in 74 ms. Remains 257 /257 variables (removed 0) and now considering 5138/5138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 257/257 places, 5138/5138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Applied a total of 0 rules in 51 ms. Remains 257 /257 variables (removed 0) and now considering 5138/5138 (removed 0) transitions.
[2025-05-30 22:58:39] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:58:39] [INFO ] Invariant cache hit.
[2025-05-30 22:58:40] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-30 22:58:40] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:58:40] [INFO ] Invariant cache hit.
[2025-05-30 22:58:41] [INFO ] State equation strengthened by 336 read => feed constraints.
[2025-05-30 22:58:41] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
[2025-05-30 22:58:42] [INFO ] Redundant transitions in 882 ms returned []
Running 5137 sub problems to find dead transitions.
[2025-05-30 22:58:42] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 22:58:42] [INFO ] Invariant cache hit.
[2025-05-30 22:58:42] [INFO ] State equation strengthened by 336 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 5137 unsolved
SMT process timed out in 114232ms, After SMT, problems are : Problem set: 0 solved, 5137 unsolved
Search for dead transitions found 0 dead transitions in 114284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116923 ms. Remains : 257/257 places, 5138/5138 transitions.
RANDOM walk for 400000 steps (9852 resets) in 6902 ms. (57 steps per ms) remains 86/199 properties
Running SMT prover for 86 properties.
[2025-05-30 23:00:39] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:00:39] [INFO ] Invariant cache hit.
[2025-05-30 23:00:39] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 5 ms returned sat
SMT process timed out, exceeded limit of 100
[2025-05-30 23:00:40] [INFO ] After 1462ms SMT Verify possible using After timeout in real domain returned unsat :0 sat :86
[2025-05-30 23:00:40] [INFO ] After 1584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :86
RANDOM walk for 40000 steps (969 resets) in 489 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199132 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199132 steps, saw 36476 distinct states, run finished after 3004 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:00:44] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:00:44] [INFO ] Invariant cache hit.
[2025-05-30 23:00:44] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4623/5183 variables, 208/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5183 variables, 96/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1506 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4623/5183 variables, 208/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 96/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1551 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3087ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 6 ms.
RANDOM walk for 40000 steps (988 resets) in 551 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199448 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199448 steps, saw 36514 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:00:50] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:00:50] [INFO ] Invariant cache hit.
[2025-05-30 23:00:50] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 435/446 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/565 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4619/5184 variables, 209/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5184 variables, 97/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 330/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/5215 variables, 26/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 26/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1464 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 435/446 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/565 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4619/5184 variables, 209/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 97/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 330/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5184 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/5215 variables, 26/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 26/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1586 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3104ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1321 steps, including 35 resets, run visited all 1 properties in 15 ms. (steps per millisecond=88 )
Parikh walk visited 1 properties in 16 ms.
RANDOM walk for 40000 steps (971 resets) in 577 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198046 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 198046 steps, saw 36317 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2025-05-30 23:00:56] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:00:56] [INFO ] Invariant cache hit.
[2025-05-30 23:00:56] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4623/5183 variables, 212/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5183 variables, 96/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1593 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4623/5183 variables, 212/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 96/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1477 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3100ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (971 resets) in 425 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199950 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199950 steps, saw 36626 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:01:02] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:02] [INFO ] Invariant cache hit.
[2025-05-30 23:01:02] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 435/446 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/565 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4619/5184 variables, 213/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5184 variables, 97/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 330/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/5215 variables, 26/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 26/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1508 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 435/446 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/565 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4619/5184 variables, 213/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 97/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 330/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5184 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/5215 variables, 26/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 26/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1930 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3474ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -173
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 77 place count 200 transition count 1181
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 93 place count 200 transition count 1165
Drop transitions (Redundant composition of simpler transitions.) removed 172 transitions
Redundant transition composition rules discarded 172 transitions
Iterating global reduction 2 with 172 rules applied. Total rules applied 265 place count 200 transition count 993
Free-agglomeration rule applied 61 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 326 place count 200 transition count 902
Reduce places removed 61 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 139 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 211 transitions.
Graph (complete) has 1211 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 273 rules applied. Total rules applied 599 place count 138 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 138 transition count 690
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 606 place count 132 transition count 648
Iterating global reduction 4 with 6 rules applied. Total rules applied 612 place count 132 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 720 place count 132 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 721 place count 131 transition count 539
Applied a total of 721 rules in 164 ms. Remains 131 /257 variables (removed 126) and now considering 539/5138 (removed 4599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 131/257 places, 539/5138 transitions.
RANDOM walk for 2603 steps (41 resets) in 93 ms. (27 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (973 resets) in 1088 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199721 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199721 steps, saw 36582 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:01:10] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:10] [INFO ] Invariant cache hit.
[2025-05-30 23:01:10] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4623/5183 variables, 213/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5183 variables, 96/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1417 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4623/5183 variables, 213/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 96/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1472 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2919ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 60 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (972 resets) in 578 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199142 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199142 steps, saw 36476 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:01:16] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:16] [INFO ] Invariant cache hit.
[2025-05-30 23:01:16] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 435/446 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/565 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4619/5184 variables, 214/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5184 variables, 97/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 330/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/5215 variables, 26/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 26/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1544 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 435/446 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/565 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4619/5184 variables, 214/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 97/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 330/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5184 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/5215 variables, 26/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 26/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1504 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3078ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (970 resets) in 436 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189482 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189482 steps, saw 35280 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-05-30 23:01:22] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:22] [INFO ] Invariant cache hit.
[2025-05-30 23:01:22] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4623/5183 variables, 211/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5183 variables, 96/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1468 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4623/5183 variables, 211/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 96/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1501 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3009ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (964 resets) in 494 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200695 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200695 steps, saw 36700 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:01:28] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:28] [INFO ] Invariant cache hit.
[2025-05-30 23:01:28] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 435/446 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/565 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4619/5184 variables, 212/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5184 variables, 97/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 330/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/5215 variables, 26/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 26/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1735 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 435/446 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/565 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4619/5184 variables, 212/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 97/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 330/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5184 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/5215 variables, 26/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 26/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1489 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3265ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 59 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (973 resets) in 510 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (53 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199373 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199373 steps, saw 36510 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:01:35] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:35] [INFO ] Invariant cache hit.
[2025-05-30 23:01:35] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 429/440 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/559 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/559 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/559 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4624/5183 variables, 209/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5183 variables, 96/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1508 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 429/440 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/559 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/559 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/559 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4624/5183 variables, 209/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 96/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1568 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3118ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 639 steps, including 15 resets, run visited all 1 properties in 6 ms. (steps per millisecond=106 )
Parikh walk visited 1 properties in 7 ms.
RANDOM walk for 40000 steps (974 resets) in 539 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199931 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199931 steps, saw 36624 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:01:41] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:41] [INFO ] Invariant cache hit.
[2025-05-30 23:01:41] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 434/445 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/564 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4620/5184 variables, 210/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5184 variables, 97/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 330/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/5215 variables, 26/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 26/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1397 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 434/445 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/564 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4620/5184 variables, 210/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 97/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 330/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5184 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/5215 variables, 26/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 26/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1492 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2919ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -173
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 77 place count 200 transition count 1181
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 93 place count 200 transition count 1165
Drop transitions (Redundant composition of simpler transitions.) removed 172 transitions
Redundant transition composition rules discarded 172 transitions
Iterating global reduction 2 with 172 rules applied. Total rules applied 265 place count 200 transition count 993
Free-agglomeration rule applied 61 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 326 place count 200 transition count 902
Reduce places removed 61 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 139 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 211 transitions.
Graph (complete) has 1211 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 273 rules applied. Total rules applied 599 place count 138 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 138 transition count 690
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 606 place count 132 transition count 648
Iterating global reduction 4 with 6 rules applied. Total rules applied 612 place count 132 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 720 place count 132 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 721 place count 131 transition count 539
Applied a total of 721 rules in 141 ms. Remains 131 /257 variables (removed 126) and now considering 539/5138 (removed 4599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 131/257 places, 539/5138 transitions.
RANDOM walk for 1453 steps (23 resets) in 15 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1003 resets) in 1764 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199487 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199487 steps, saw 36528 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:01:48] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:48] [INFO ] Invariant cache hit.
[2025-05-30 23:01:48] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 425/436 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/555 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4628/5183 variables, 213/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5183 variables, 96/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1507 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 425/436 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/555 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4628/5183 variables, 213/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5183 variables, 96/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1407 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2943ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (981 resets) in 517 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199931 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199931 steps, saw 36624 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:01:54] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:01:54] [INFO ] Invariant cache hit.
[2025-05-30 23:01:54] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4624/5184 variables, 214/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5184 variables, 97/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 330/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/5215 variables, 26/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 26/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1487 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 430/441 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/560 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 119/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4624/5184 variables, 214/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5184 variables, 97/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5184 variables, 330/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5184 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/5215 variables, 26/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 26/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1509 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3029ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 91 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (970 resets) in 493 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199721 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199721 steps, saw 36582 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:02:00] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:02:00] [INFO ] Invariant cache hit.
[2025-05-30 23:02:00] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1287 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1485 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2810ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 247 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1377 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (108 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1328152 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1328152 steps, saw 196223 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
[2025-05-30 23:02:06] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:02:06] [INFO ] Computed 18 invariants in 5 ms
[2025-05-30 23:02:06] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 4 ms.
RANDOM walk for 40000 steps (992 resets) in 1720 ms. (23 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199234 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199234 steps, saw 36476 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:02:10] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:02:10] [INFO ] Computed 18 invariants in 46 ms
[2025-05-30 23:02:10] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1283 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1428 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2806ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 190 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1488 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (115 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1485139 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :0 out of 1
Probabilistic random walk after 1485139 steps, saw 188858 distinct states, run finished after 3001 ms. (steps per millisecond=494 ) properties seen :0
[2025-05-30 23:02:16] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:02:16] [INFO ] Computed 18 invariants in 2 ms
[2025-05-30 23:02:16] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 2180 steps (50 resets) in 37 ms. (57 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (984 resets) in 548 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200623 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200623 steps, saw 36688 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:02:20] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:02:20] [INFO ] Computed 18 invariants in 40 ms
[2025-05-30 23:02:20] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1394 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1454 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2927ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 184 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1388 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1259592 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 1
Probabilistic random walk after 1259592 steps, saw 185716 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :0
[2025-05-30 23:02:26] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:02:26] [INFO ] Computed 18 invariants in 4 ms
[2025-05-30 23:02:26] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 321ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 602/602 transitions.
Applied a total of 0 rules in 9 ms. Remains 143 /143 variables (removed 0) and now considering 602/602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 143/143 places, 602/602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 602/602 transitions.
Applied a total of 0 rules in 9 ms. Remains 143 /143 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2025-05-30 23:02:26] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
[2025-05-30 23:02:26] [INFO ] Invariant cache hit.
[2025-05-30 23:02:26] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 23:02:26] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
[2025-05-30 23:02:26] [INFO ] Invariant cache hit.
[2025-05-30 23:02:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 23:02:27] [INFO ] Implicit Places using invariants and state equation in 906 ms returned [0, 2, 19, 34, 36, 51, 53, 68, 70, 85, 87]
[2025-05-30 23:02:27] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1056 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 142/143 places, 601/602 transitions.
Applied a total of 0 rules in 11 ms. Remains 142 /142 variables (removed 0) and now considering 601/601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1076 ms. Remains : 142/143 places, 601/602 transitions.
RANDOM walk for 40000 steps (1278 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (109 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1185280 steps, run timeout after 3001 ms. (steps per millisecond=394 ) properties seen :0 out of 1
Probabilistic random walk after 1185280 steps, saw 184444 distinct states, run finished after 3001 ms. (steps per millisecond=394 ) properties seen :0
[2025-05-30 23:02:30] [INFO ] Flow matrix only has 319 transitions (discarded 282 similar events)
// Phase 1: matrix 319 rows 142 cols
[2025-05-30 23:02:30] [INFO ] Computed 18 invariants in 5 ms
[2025-05-30 23:02:30] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 22/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/64 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/275 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/383 variables, 30/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/449 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/461 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/461 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/64 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/275 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/383 variables, 30/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/449 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/461 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/461 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 309ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3336 steps, including 87 resets, run visited all 1 properties in 11 ms. (steps per millisecond=303 )
Parikh walk visited 1 properties in 11 ms.
RANDOM walk for 40000 steps (990 resets) in 516 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (54 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199694 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199694 steps, saw 36571 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:02:34] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:02:34] [INFO ] Computed 18 invariants in 41 ms
[2025-05-30 23:02:34] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1405 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1458 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2948ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 200 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1514 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (114 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1465081 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :0 out of 1
Probabilistic random walk after 1465081 steps, saw 186426 distinct states, run finished after 3001 ms. (steps per millisecond=488 ) properties seen :0
[2025-05-30 23:02:40] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:02:40] [INFO ] Computed 18 invariants in 8 ms
[2025-05-30 23:02:40] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 354ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 0 ms.
RANDOM walk for 3740 steps (87 resets) in 45 ms. (81 steps per ms) remains 0/1 properties
RANDOM walk for 864 steps (18 resets) in 18 ms. (45 steps per ms) remains 0/1 properties
RANDOM walk for 261 steps (4 resets) in 8 ms. (29 steps per ms) remains 0/1 properties
RANDOM walk for 2852 steps (67 resets) in 37 ms. (75 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (981 resets) in 551 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (51 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200814 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200814 steps, saw 36706 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:02:44] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:02:44] [INFO ] Computed 18 invariants in 41 ms
[2025-05-30 23:02:44] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1308 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1452 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2845ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 182 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1369 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (109 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1254511 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :0 out of 1
Probabilistic random walk after 1254511 steps, saw 184842 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :0
[2025-05-30 23:02:50] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:02:50] [INFO ] Computed 18 invariants in 4 ms
[2025-05-30 23:02:50] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (982 resets) in 511 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200820 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200820 steps, saw 36706 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:02:53] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:02:54] [INFO ] Computed 18 invariants in 42 ms
[2025-05-30 23:02:54] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1422 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1481 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2991ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 193 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1499 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (120 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1458101 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :0 out of 1
Probabilistic random walk after 1458101 steps, saw 185640 distinct states, run finished after 3004 ms. (steps per millisecond=485 ) properties seen :0
[2025-05-30 23:03:00] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:03:00] [INFO ] Computed 18 invariants in 4 ms
[2025-05-30 23:03:00] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 2791 steps (68 resets) in 46 ms. (59 steps per ms) remains 0/1 properties
RANDOM walk for 586 steps (13 resets) in 12 ms. (45 steps per ms) remains 0/1 properties
RANDOM walk for 92 steps (1 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 10333 steps (252 resets) in 126 ms. (81 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (982 resets) in 447 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198667 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198667 steps, saw 36438 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:03:03] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:03:03] [INFO ] Computed 18 invariants in 40 ms
[2025-05-30 23:03:03] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1309 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1464 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2856ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 180 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1373 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (111 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1319324 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :0 out of 1
Probabilistic random walk after 1319324 steps, saw 161616 distinct states, run finished after 3002 ms. (steps per millisecond=439 ) properties seen :0
[2025-05-30 23:03:10] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:03:10] [INFO ] Computed 18 invariants in 3 ms
[2025-05-30 23:03:10] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 602/602 transitions.
Applied a total of 0 rules in 10 ms. Remains 143 /143 variables (removed 0) and now considering 602/602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 143/143 places, 602/602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 602/602 transitions.
Applied a total of 0 rules in 10 ms. Remains 143 /143 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2025-05-30 23:03:10] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
[2025-05-30 23:03:10] [INFO ] Invariant cache hit.
[2025-05-30 23:03:10] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-30 23:03:10] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
[2025-05-30 23:03:10] [INFO ] Invariant cache hit.
[2025-05-30 23:03:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 23:03:11] [INFO ] Implicit Places using invariants and state equation in 954 ms returned [0, 2, 17, 19, 34, 36, 51, 53, 68, 70, 87]
[2025-05-30 23:03:11] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1097 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 142/143 places, 601/602 transitions.
Applied a total of 0 rules in 13 ms. Remains 142 /142 variables (removed 0) and now considering 601/601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1120 ms. Remains : 142/143 places, 601/602 transitions.
RANDOM walk for 40000 steps (1282 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (107 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1211449 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 1
Probabilistic random walk after 1211449 steps, saw 185439 distinct states, run finished after 3002 ms. (steps per millisecond=403 ) properties seen :0
[2025-05-30 23:03:14] [INFO ] Flow matrix only has 319 transitions (discarded 282 similar events)
// Phase 1: matrix 319 rows 142 cols
[2025-05-30 23:03:14] [INFO ] Computed 18 invariants in 4 ms
[2025-05-30 23:03:14] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 22/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/64 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/275 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/383 variables, 30/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/449 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/461 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/461 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/64 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/275 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/383 variables, 30/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/449 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/461 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/461 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 325ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (974 resets) in 451 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (57 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198203 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198203 steps, saw 36341 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:03:18] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:03:18] [INFO ] Computed 18 invariants in 39 ms
[2025-05-30 23:03:18] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1243 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1451 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2773ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 179 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1513 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (118 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1431467 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1431467 steps, saw 182145 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
[2025-05-30 23:03:24] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:03:24] [INFO ] Computed 18 invariants in 4 ms
[2025-05-30 23:03:24] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 4538 steps (102 resets) in 64 ms. (69 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (987 resets) in 497 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198968 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198968 steps, saw 36465 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:03:27] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:03:27] [INFO ] Computed 18 invariants in 40 ms
[2025-05-30 23:03:27] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 80/81 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/130 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1263 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 80/81 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/130 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1517 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2869ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 241 transition count 1039
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 241 transition count 1039
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 238 transition count 1036
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 238 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 236 transition count 1034
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 236 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 1033
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 1033
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 68 place count 223 transition count 1147
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 223 transition count 1135
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 1 with 120 rules applied. Total rules applied 200 place count 223 transition count 1015
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 1 with 66 rules applied. Total rules applied 266 place count 223 transition count 919
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 548 place count 157 transition count 703
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 554 place count 151 transition count 661
Iterating global reduction 2 with 6 rules applied. Total rules applied 560 place count 151 transition count 661
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 2 with 108 rules applied. Total rules applied 668 place count 151 transition count 553
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 674 place count 151 transition count 604
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 680 place count 145 transition count 604
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 681 place count 145 transition count 604
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 682 place count 144 transition count 603
Applied a total of 682 rules in 309 ms. Remains 144 /257 variables (removed 113) and now considering 603/5138 (removed 4535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 144/257 places, 603/5138 transitions.
RANDOM walk for 40000 steps (1471 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (109 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1479100 steps, run timeout after 3001 ms. (steps per millisecond=492 ) properties seen :0 out of 1
Probabilistic random walk after 1479100 steps, saw 183049 distinct states, run finished after 3001 ms. (steps per millisecond=492 ) properties seen :0
[2025-05-30 23:03:33] [INFO ] Flow matrix only has 321 transitions (discarded 282 similar events)
// Phase 1: matrix 321 rows 144 cols
[2025-05-30 23:03:33] [INFO ] Computed 18 invariants in 4 ms
[2025-05-30 23:03:33] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 26/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/66 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 213/279 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/387 variables, 30/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/453 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/465 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/465 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 144/144 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/66 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 213/279 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/387 variables, 30/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/453 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/465 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/465 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 144/144 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 0 ms.
RANDOM walk for 486 steps (9 resets) in 9 ms. (48 steps per ms) remains 0/1 properties
RANDOM walk for 161 steps (2 resets) in 9 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 1067 steps (25 resets) in 17 ms. (59 steps per ms) remains 0/1 properties
RANDOM walk for 137 steps (2 resets) in 6 ms. (19 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (990 resets) in 498 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199950 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199950 steps, saw 36626 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:03:37] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:03:37] [INFO ] Computed 18 invariants in 43 ms
[2025-05-30 23:03:37] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1438 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1376 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 178 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1352 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (110 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1257785 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 1
Probabilistic random walk after 1257785 steps, saw 184993 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :0
[2025-05-30 23:03:43] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:03:43] [INFO ] Computed 18 invariants in 4 ms
[2025-05-30 23:03:43] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (953 resets) in 468 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (54 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198754 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198754 steps, saw 36442 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:03:47] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:03:47] [INFO ] Computed 18 invariants in 54 ms
[2025-05-30 23:03:47] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1442 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1370 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2908ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 175 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1491 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (113 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1458289 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :0 out of 1
Probabilistic random walk after 1458289 steps, saw 185662 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
[2025-05-30 23:03:53] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:03:53] [INFO ] Computed 18 invariants in 3 ms
[2025-05-30 23:03:53] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 0 ms.
RANDOM walk for 875 steps (16 resets) in 21 ms. (39 steps per ms) remains 0/1 properties
RANDOM walk for 240 steps (5 resets) in 8 ms. (26 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (973 resets) in 502 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199540 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199540 steps, saw 36538 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:03:56] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:03:56] [INFO ] Computed 18 invariants in 32 ms
[2025-05-30 23:03:56] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1263 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/130 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1420 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2760ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 185 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1375 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (113 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1364916 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 1
Probabilistic random walk after 1364916 steps, saw 179943 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
[2025-05-30 23:04:02] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:04:02] [INFO ] Computed 18 invariants in 3 ms
[2025-05-30 23:04:02] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (978 resets) in 471 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (57 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199397 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199397 steps, saw 36512 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:04:06] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:04:06] [INFO ] Computed 18 invariants in 39 ms
[2025-05-30 23:04:06] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1430 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/130 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1471 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2987ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 0 with 2049 rules applied. Total rules applied 2050 place count 256 transition count 3089
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 2051 place count 255 transition count 3089
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 2066 place count 240 transition count 1038
Iterating global reduction 2 with 15 rules applied. Total rules applied 2081 place count 240 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2084 place count 237 transition count 1035
Iterating global reduction 2 with 3 rules applied. Total rules applied 2087 place count 237 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 235 transition count 1033
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 235 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2092 place count 234 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 2093 place count 234 transition count 1032
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 2117 place count 222 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2129 place count 222 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 3 with 120 rules applied. Total rules applied 2249 place count 222 transition count 1014
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2315 place count 222 transition count 918
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 2597 place count 156 transition count 702
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 2603 place count 150 transition count 660
Iterating global reduction 4 with 6 rules applied. Total rules applied 2609 place count 150 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 2717 place count 150 transition count 552
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2723 place count 150 transition count 603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2729 place count 144 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2730 place count 144 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2731 place count 143 transition count 602
Applied a total of 2731 rules in 191 ms. Remains 143 /257 variables (removed 114) and now considering 602/5138 (removed 4536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 143/257 places, 602/5138 transitions.
RANDOM walk for 40000 steps (1512 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (113 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1352072 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :0 out of 1
Probabilistic random walk after 1352072 steps, saw 172645 distinct states, run finished after 3002 ms. (steps per millisecond=450 ) properties seen :0
[2025-05-30 23:04:12] [INFO ] Flow matrix only has 320 transitions (discarded 282 similar events)
// Phase 1: matrix 320 rows 143 cols
[2025-05-30 23:04:12] [INFO ] Computed 18 invariants in 3 ms
[2025-05-30 23:04:12] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/451 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/463 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/385 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/451 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/463 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 143/143 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 90 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 831 steps (17 resets) in 25 ms. (31 steps per ms) remains 0/1 properties
RANDOM walk for 92 steps (1 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (975 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (59 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199573 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199573 steps, saw 36543 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:04:16] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
// Phase 1: matrix 4958 rows 257 cols
[2025-05-30 23:04:16] [INFO ] Computed 18 invariants in 42 ms
[2025-05-30 23:04:16] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/117 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/245 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4793/5038 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5038 variables, 32/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5038 variables, 270/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5038 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 167/5205 variables, 82/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5205 variables, 82/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5205 variables, 65/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5205 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/5215 variables, 10/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5215 variables, 10/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1715 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/117 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/245 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/245 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4793/5038 variables, 158/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5038 variables, 32/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5038 variables, 270/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5038 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 167/5205 variables, 82/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5205 variables, 82/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5205 variables, 65/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5205 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 10/5215 variables, 10/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5215 variables, 10/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1632 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3421ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 64 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (982 resets) in 436 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199633 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199633 steps, saw 36545 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:04:22] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:04:22] [INFO ] Invariant cache hit.
[2025-05-30 23:04:22] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 423/438 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/557 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/557 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4626/5183 variables, 211/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 94/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1610 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 423/438 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/557 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/557 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4626/5183 variables, 211/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 94/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1547 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3184ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 215 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=107 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 281 steps (6 resets) in 9 ms. (28 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (985 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199721 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199721 steps, saw 36582 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:04:29] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:04:29] [INFO ] Invariant cache hit.
[2025-05-30 23:04:29] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1266 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1502 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2797ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 220 transition count 1012
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 220 transition count 1012
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 218 transition count 1010
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 218 transition count 1010
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 217 transition count 1009
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 217 transition count 1009
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 79 place count 199 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 97 place count 199 transition count 1183
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 289 place count 199 transition count 991
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 349 place count 199 transition count 901
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1208 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 620 place count 138 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 138 transition count 690
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 627 place count 132 transition count 648
Iterating global reduction 4 with 6 rules applied. Total rules applied 633 place count 132 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 741 place count 132 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 742 place count 131 transition count 539
Applied a total of 742 rules in 93 ms. Remains 131 /257 variables (removed 126) and now considering 539/5138 (removed 4599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 131/257 places, 539/5138 transitions.
RANDOM walk for 1975 steps (29 resets) in 16 ms. (116 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (991 resets) in 422 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198899 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198899 steps, saw 36462 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:04:35] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:04:35] [INFO ] Invariant cache hit.
[2025-05-30 23:04:35] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1420 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2742ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 220 transition count 1012
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 220 transition count 1012
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 219 transition count 1011
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 218 transition count 1010
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 218 transition count 1010
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 77 place count 200 transition count 1202
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 95 place count 200 transition count 1184
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 287 place count 200 transition count 992
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 347 place count 200 transition count 902
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1210 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 618 place count 139 transition count 692
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 619 place count 139 transition count 691
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 625 place count 133 transition count 649
Iterating global reduction 4 with 6 rules applied. Total rules applied 631 place count 133 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 739 place count 133 transition count 541
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 740 place count 132 transition count 540
Applied a total of 740 rules in 101 ms. Remains 132 /257 variables (removed 125) and now considering 540/5138 (removed 4598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 132/257 places, 540/5138 transitions.
RANDOM walk for 1108 steps (17 resets) in 10 ms. (100 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (983 resets) in 431 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (55 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198522 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198522 steps, saw 36421 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:04:41] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:04:41] [INFO ] Invariant cache hit.
[2025-05-30 23:04:41] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1395 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1558 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2982ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 220 transition count 1012
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 220 transition count 1012
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 219 transition count 1011
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 219 transition count 1011
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 201 transition count 1203
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 93 place count 201 transition count 1185
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 285 place count 201 transition count 993
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 345 place count 201 transition count 903
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1212 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 616 place count 140 transition count 693
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 140 transition count 692
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 623 place count 134 transition count 650
Iterating global reduction 4 with 6 rules applied. Total rules applied 629 place count 134 transition count 650
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 737 place count 134 transition count 542
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 738 place count 133 transition count 541
Applied a total of 738 rules in 93 ms. Remains 133 /257 variables (removed 124) and now considering 541/5138 (removed 4597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 133/257 places, 541/5138 transitions.
RANDOM walk for 845 steps (11 resets) in 6 ms. (120 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (991 resets) in 437 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (57 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 196861 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 196861 steps, saw 36113 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2025-05-30 23:04:47] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:04:47] [INFO ] Invariant cache hit.
[2025-05-30 23:04:47] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1289 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1695 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3018ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 220 transition count 1012
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 220 transition count 1012
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 219 transition count 1011
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 219 transition count 1011
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 201 transition count 1203
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 93 place count 201 transition count 1185
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 285 place count 201 transition count 993
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 345 place count 201 transition count 903
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1212 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 616 place count 140 transition count 693
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 140 transition count 692
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 623 place count 134 transition count 650
Iterating global reduction 4 with 6 rules applied. Total rules applied 629 place count 134 transition count 650
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 737 place count 134 transition count 542
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 738 place count 133 transition count 541
Applied a total of 738 rules in 92 ms. Remains 133 /257 variables (removed 124) and now considering 541/5138 (removed 4597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 133/257 places, 541/5138 transitions.
RANDOM walk for 1682 steps (21 resets) in 14 ms. (112 steps per ms) remains 0/1 properties
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (961 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (57 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 197928 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 197928 steps, saw 36252 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2025-05-30 23:04:53] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:04:53] [INFO ] Invariant cache hit.
[2025-05-30 23:04:53] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 427/442 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/561 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4622/5183 variables, 207/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 94/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1515 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 427/442 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/561 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5183/5215 variables, and 386 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1349 ms.
Refiners :[Domain max(s): 136/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 230/257 constraints, ReadFeed: 1/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2893ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 609 steps, including 37 resets, run visited all 1 properties in 4 ms. (steps per millisecond=152 )
Parikh walk visited 1 properties in 4 ms.
RANDOM walk for 328 steps (6 resets) in 11 ms. (27 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (975 resets) in 422 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199044 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199044 steps, saw 36472 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:05:00] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:00] [INFO ] Invariant cache hit.
[2025-05-30 23:05:00] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1314 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1484 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2825ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 92 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1229 steps (18 resets) in 8 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1013 resets) in 465 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (51 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198203 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198203 steps, saw 36341 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:05:06] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:06] [INFO ] Invariant cache hit.
[2025-05-30 23:05:06] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1265 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1521 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2820ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 103 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1591 steps (25 resets) in 11 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (983 resets) in 440 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (54 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188677 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188677 steps, saw 35183 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2025-05-30 23:05:12] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:12] [INFO ] Invariant cache hit.
[2025-05-30 23:05:12] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1317 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1547 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 218 transition count 1010
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 218 transition count 1010
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 217 transition count 1009
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 217 transition count 1009
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 79 place count 199 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 97 place count 199 transition count 1183
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 289 place count 199 transition count 991
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 349 place count 199 transition count 901
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1208 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 620 place count 138 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 138 transition count 690
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 627 place count 132 transition count 648
Iterating global reduction 4 with 6 rules applied. Total rules applied 633 place count 132 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 741 place count 132 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 742 place count 131 transition count 539
Applied a total of 742 rules in 96 ms. Remains 131 /257 variables (removed 126) and now considering 539/5138 (removed 4599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 131/257 places, 539/5138 transitions.
RANDOM walk for 2198 steps (33 resets) in 14 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (967 resets) in 426 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (55 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189121 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189121 steps, saw 35241 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-05-30 23:05:18] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:18] [INFO ] Invariant cache hit.
[2025-05-30 23:05:18] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1275 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1533 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2840ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 218 transition count 1010
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 218 transition count 1010
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 77 place count 200 transition count 1202
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 95 place count 200 transition count 1184
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 287 place count 200 transition count 992
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 347 place count 200 transition count 902
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1210 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 618 place count 139 transition count 692
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 619 place count 139 transition count 691
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 625 place count 133 transition count 649
Iterating global reduction 4 with 6 rules applied. Total rules applied 631 place count 133 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 739 place count 133 transition count 541
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 740 place count 132 transition count 540
Applied a total of 740 rules in 93 ms. Remains 132 /257 variables (removed 125) and now considering 540/5138 (removed 4598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 132/257 places, 540/5138 transitions.
RANDOM walk for 782 steps (10 resets) in 10 ms. (71 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (987 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (58 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189494 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189494 steps, saw 35280 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-05-30 23:05:24] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:24] [INFO ] Invariant cache hit.
[2025-05-30 23:05:24] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1342 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1531 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2902ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 218 transition count 1010
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 218 transition count 1010
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 77 place count 200 transition count 1202
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 95 place count 200 transition count 1184
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 287 place count 200 transition count 992
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 347 place count 200 transition count 902
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1210 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 618 place count 139 transition count 692
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 619 place count 139 transition count 691
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 625 place count 133 transition count 649
Iterating global reduction 4 with 6 rules applied. Total rules applied 631 place count 133 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 739 place count 133 transition count 541
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 740 place count 132 transition count 540
Applied a total of 740 rules in 85 ms. Remains 132 /257 variables (removed 125) and now considering 540/5138 (removed 4598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 132/257 places, 540/5138 transitions.
RANDOM walk for 1374 steps (18 resets) in 14 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (985 resets) in 457 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189313 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189313 steps, saw 35268 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-05-30 23:05:30] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:30] [INFO ] Invariant cache hit.
[2025-05-30 23:05:30] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/117 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/245 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4793/5038 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5038 variables, 32/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5038 variables, 270/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5038 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 167/5205 variables, 82/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5205 variables, 82/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5205 variables, 65/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5205 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/5215 variables, 10/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5215 variables, 10/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1675 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/117 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/245 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/245 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4793/5038 variables, 158/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5038 variables, 32/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5038 variables, 270/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5038 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 167/5205 variables, 82/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5205 variables, 82/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5205 variables, 65/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5205 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 10/5215 variables, 10/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5215 variables, 10/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1610 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3318ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 389 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=129 )
Parikh walk visited 1 properties in 4 ms.
RANDOM walk for 40000 steps (995 resets) in 422 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188920 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188920 steps, saw 35212 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
[2025-05-30 23:05:37] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:37] [INFO ] Invariant cache hit.
[2025-05-30 23:05:37] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/443 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/562 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4621/5183 variables, 209/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 94/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1602 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/443 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/562 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/562 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4621/5183 variables, 209/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 94/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1573 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3209ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 567 steps, including 12 resets, run visited all 1 properties in 5 ms. (steps per millisecond=113 )
Parikh walk visited 1 properties in 5 ms.
RANDOM walk for 95 steps (0 resets) in 8 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (980 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (55 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 187278 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 187278 steps, saw 34897 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
[2025-05-30 23:05:43] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:43] [INFO ] Invariant cache hit.
[2025-05-30 23:05:43] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1288 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1646 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2963ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 91 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 990 steps (14 resets) in 10 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (998 resets) in 463 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (52 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189129 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189129 steps, saw 35242 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-05-30 23:05:50] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:50] [INFO ] Invariant cache hit.
[2025-05-30 23:05:50] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1265 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1439 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2755ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 96 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1354 steps (19 resets) in 11 ms. (112 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (969 resets) in 430 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (55 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188920 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188920 steps, saw 35212 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2025-05-30 23:05:56] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:05:56] [INFO ] Invariant cache hit.
[2025-05-30 23:05:56] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1286 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1541 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2858ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 101 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 804 steps (10 resets) in 12 ms. (61 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (995 resets) in 448 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 191134 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 191134 steps, saw 35512 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-05-30 23:06:02] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:02] [INFO ] Invariant cache hit.
[2025-05-30 23:06:02] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1278 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1496 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2807ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 79 place count 199 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 97 place count 199 transition count 1183
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 289 place count 199 transition count 991
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 349 place count 199 transition count 901
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1208 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 620 place count 138 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 138 transition count 690
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 627 place count 132 transition count 648
Iterating global reduction 4 with 6 rules applied. Total rules applied 633 place count 132 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 741 place count 132 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 742 place count 131 transition count 539
Applied a total of 742 rules in 96 ms. Remains 131 /257 variables (removed 126) and now considering 539/5138 (removed 4599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 131/257 places, 539/5138 transitions.
RANDOM walk for 2319 steps (37 resets) in 13 ms. (165 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (993 resets) in 443 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198315 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198315 steps, saw 36356 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:06:08] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:08] [INFO ] Invariant cache hit.
[2025-05-30 23:06:08] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1316 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1497 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2841ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 79 place count 199 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 97 place count 199 transition count 1183
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 289 place count 199 transition count 991
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 349 place count 199 transition count 901
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1208 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 620 place count 138 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 138 transition count 690
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 627 place count 132 transition count 648
Iterating global reduction 4 with 6 rules applied. Total rules applied 633 place count 132 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 741 place count 132 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 742 place count 131 transition count 539
Applied a total of 742 rules in 84 ms. Remains 131 /257 variables (removed 126) and now considering 539/5138 (removed 4599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 131/257 places, 539/5138 transitions.
RANDOM walk for 1017 steps (16 resets) in 10 ms. (92 steps per ms) remains 0/1 properties
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (966 resets) in 650 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (55 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198263 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198263 steps, saw 36352 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:06:14] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:14] [INFO ] Invariant cache hit.
[2025-05-30 23:06:14] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/443 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/562 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4621/5183 variables, 211/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 94/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1538 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/443 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/562 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/562 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4621/5183 variables, 211/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 94/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1677 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3247ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 66 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 327 steps (6 resets) in 9 ms. (32 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1002 resets) in 430 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 197636 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 197636 steps, saw 36226 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2025-05-30 23:06:21] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:21] [INFO ] Invariant cache hit.
[2025-05-30 23:06:21] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1441 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1545 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3013ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 90 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 635 steps (8 resets) in 8 ms. (70 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (974 resets) in 437 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 194155 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 194155 steps, saw 35913 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2025-05-30 23:06:27] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:27] [INFO ] Invariant cache hit.
[2025-05-30 23:06:27] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1208 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1460 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2708ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 87 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 2189 steps (35 resets) in 15 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (991 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (54 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200422 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200422 steps, saw 36665 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:06:33] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:33] [INFO ] Invariant cache hit.
[2025-05-30 23:06:33] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1206 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1594 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2826ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 89 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1734 steps (26 resets) in 15 ms. (108 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (986 resets) in 440 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (54 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 193990 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 193990 steps, saw 35880 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2025-05-30 23:06:39] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:39] [INFO ] Invariant cache hit.
[2025-05-30 23:06:39] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1234 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1412 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2685ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 86 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1801 steps (29 resets) in 16 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (978 resets) in 495 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198978 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198978 steps, saw 36465 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:06:45] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:45] [INFO ] Invariant cache hit.
[2025-05-30 23:06:45] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1261 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1471 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2759ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 86 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 893 steps (13 resets) in 9 ms. (89 steps per ms) remains 0/1 properties
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (983 resets) in 428 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200272 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200272 steps, saw 36654 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:06:51] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:51] [INFO ] Invariant cache hit.
[2025-05-30 23:06:51] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/117 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/245 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4793/5038 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5038 variables, 32/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5038 variables, 270/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5038 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 167/5205 variables, 82/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5205 variables, 82/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5205 variables, 65/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5205 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/5215 variables, 10/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5215 variables, 10/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1588 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/117 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/245 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/245 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4793/5038 variables, 158/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5038 variables, 32/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5038 variables, 270/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5038 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 167/5205 variables, 82/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5205 variables, 82/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5205 variables, 65/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5205 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 10/5215 variables, 10/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5215 variables, 10/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1707 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3332ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 305 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=101 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (970 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199573 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199573 steps, saw 36543 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:06:58] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:06:58] [INFO ] Invariant cache hit.
[2025-05-30 23:06:58] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/443 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/562 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4621/5183 variables, 210/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 94/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1445 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/443 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/562 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/562 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4621/5183 variables, 210/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 94/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1875 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3349ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 75 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 84 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (984 resets) in 632 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (52 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198279 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198279 steps, saw 36354 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:07:04] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:07:04] [INFO ] Invariant cache hit.
[2025-05-30 23:07:04] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1419 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1465 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2913ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 90 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1144 steps (15 resets) in 10 ms. (104 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (987 resets) in 423 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (57 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199628 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199628 steps, saw 36545 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:07:11] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:07:11] [INFO ] Invariant cache hit.
[2025-05-30 23:07:11] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1246 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1655 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 92 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1401 steps (22 resets) in 12 ms. (107 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (984 resets) in 429 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (58 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200281 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200281 steps, saw 36655 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:07:17] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:07:17] [INFO ] Invariant cache hit.
[2025-05-30 23:07:17] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1204 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1726 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2964ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 98 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1727 steps (27 resets) in 8 ms. (191 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (961 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (57 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198982 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198982 steps, saw 36465 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:07:23] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:07:23] [INFO ] Invariant cache hit.
[2025-05-30 23:07:23] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1280 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1573 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 93 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 229 steps (3 resets) in 4 ms. (45 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (987 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (51 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200773 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200773 steps, saw 36706 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:07:29] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:07:29] [INFO ] Invariant cache hit.
[2025-05-30 23:07:29] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1239 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1634 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2908ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 90 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 2111 steps (33 resets) in 19 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 213 steps (3 resets) in 9 ms. (21 steps per ms) remains 0/1 properties
RANDOM walk for 25425 steps (617 resets) in 276 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 19137 steps (461 resets) in 206 ms. (92 steps per ms) remains 0/1 properties
RANDOM walk for 15258 steps (379 resets) in 174 ms. (87 steps per ms) remains 0/1 properties
RANDOM walk for 14625 steps (352 resets) in 162 ms. (89 steps per ms) remains 0/1 properties
RANDOM walk for 15761 steps (375 resets) in 184 ms. (85 steps per ms) remains 0/1 properties
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 13438 steps (321 resets) in 149 ms. (89 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (992 resets) in 422 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (57 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1472 steps, run visited all 1 properties in 8 ms. (steps per millisecond=184 )
Probabilistic random walk after 1472 steps, saw 1440 distinct states, run finished after 12 ms. (steps per millisecond=122 ) properties seen :1
RANDOM walk for 76 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (970 resets) in 427 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (54 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199945 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199945 steps, saw 36625 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:07:36] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:07:36] [INFO ] Invariant cache hit.
[2025-05-30 23:07:36] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/443 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/562 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4621/5183 variables, 206/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5183 variables, 94/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 330/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/5215 variables, 27/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5215 variables, 27/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 5/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1404 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/443 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/562 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 119/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/562 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4621/5183 variables, 206/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5183 variables, 94/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5183 variables, 330/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5183 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/5215 variables, 27/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5215 variables, 27/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5215 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1593 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3025ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (975 resets) in 430 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (54 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198815 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198815 steps, saw 36446 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:07:42] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:07:42] [INFO ] Invariant cache hit.
[2025-05-30 23:07:43] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1403 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1457 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2888ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 222 transition count 1014
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 222 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 219 transition count 1011
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 219 transition count 1011
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 217 transition count 1009
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 217 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 216 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 216 transition count 1008
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 81 place count 198 transition count 1200
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 99 place count 198 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 291 place count 198 transition count 990
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 351 place count 198 transition count 900
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1207 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 622 place count 137 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 137 transition count 689
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 629 place count 131 transition count 647
Iterating global reduction 4 with 6 rules applied. Total rules applied 635 place count 131 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 743 place count 131 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 130 transition count 538
Applied a total of 744 rules in 90 ms. Remains 130 /257 variables (removed 127) and now considering 538/5138 (removed 4600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 130/257 places, 538/5138 transitions.
RANDOM walk for 1784 steps (25 resets) in 12 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (983 resets) in 421 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199204 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199204 steps, saw 36476 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-05-30 23:07:49] [INFO ] Flow matrix only has 4958 transitions (discarded 180 similar events)
[2025-05-30 23:07:49] [INFO ] Invariant cache hit.
[2025-05-30 23:07:49] [INFO ] State equation strengthened by 336 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 265/5203 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5203 variables, 115/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 78/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/5215 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5215 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/5215 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5215/5215 variables, and 868 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1290 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 50/51 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4808/4938 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4938 variables, 258/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4938 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4938 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 265/5203 variables, 115/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5203 variables, 115/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5203 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5203 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/5215 variables, 12/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5215 variables, 12/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/5215 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5215/5215 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1473 ms.
Refiners :[Domain max(s): 257/257 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 257/257 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2791ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 5138/5138 transitions.
Graph (complete) has 2467 edges and 257 vertex of which 226 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 4096 output transitions
Drop transitions (Output transitions of discarded places.) removed 4096 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 226 transition count 1018
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 223 transition count 1015
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 223 transition count 1015
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 220 transition count 1012
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 220 transition count 1012
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 218 transition count 1010
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 218 transition count 1010
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 217 transition count 1009
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 217 transition count 1009
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -192
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 79 place count 199 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 97 place count 199 transition count 1183
Drop transitions (Redundant composition of simpler transitions.) removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 2 with 192 rules applied. Total rules applied 289 place count 199 transition count 991
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 349 place count 199 transition count 901
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 1208 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 271 rules applied. Total rules applied 620 place count 138 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 138 transition count 690
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 627 place count 132 transition count 648
Iterating global reduction 4 with 6 rules applied. Total rules applied 633 place count 132 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 741 place count 132 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 742 place count 131 transition count 539
Applied a total of 742 rules in 101 ms. Remains 131 /257 variables (removed 126) and now considering 539/5138 (removed 4599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 131/257 places, 539/5138 transitions.
RANDOM walk for 1480 steps (20 resets) in 9 ms. (148 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (982 resets) in 428 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (59 resets) in 50 ms. (784 steps per ms) remains 1/1 properties

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="CloudDeployment-PT-6b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is CloudDeployment-PT-6b, 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 r056-tall-174854041500047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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