About the Execution of 2024-gold for DES-PT-20a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15689.740 | 1230120.00 | 1678692.00 | 3440.20 | F | normal |
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.r070-smll-174854076400188.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 DES-PT-20a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076400188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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.4K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 57K 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 StableMarking
=== Now, execution of the tool begins
BK_START 1748653307052
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 01:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 01:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 01:01:50] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2025-05-31 01:01:50] [INFO ] Transformed 195 places.
[2025-05-31 01:01:50] [INFO ] Transformed 152 transitions.
[2025-05-31 01:01:50] [INFO ] Found NUPN structural information;
[2025-05-31 01:01:50] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 427 ms.
Structural test allowed to assert that 44 places are NOT stable. Took 14 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
RANDOM walk for 40000 steps (879 resets) in 4511 ms. (8 steps per ms) remains 62/151 properties
BEST_FIRST walk for 4001 steps (20 resets) in 76 ms. (51 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (16 resets) in 72 ms. (54 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (20 resets) in 47 ms. (83 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (19 resets) in 53 ms. (74 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (18 resets) in 71 ms. (55 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (12 resets) in 73 ms. (54 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (15 resets) in 79 ms. (50 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (16 resets) in 53 ms. (74 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (18 resets) in 65 ms. (60 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (19 resets) in 52 ms. (75 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (19 resets) in 44 ms. (88 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (18 resets) in 56 ms. (70 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (21 resets) in 38 ms. (102 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (16 resets) in 68 ms. (58 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (18 resets) in 34 ms. (114 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (19 resets) in 50 ms. (78 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (14 resets) in 45 ms. (87 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (18 resets) in 46 ms. (85 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (17 resets) in 54 ms. (72 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (13 resets) in 42 ms. (93 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (19 resets) in 56 ms. (70 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (19 resets) in 52 ms. (75 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (16 resets) in 37 ms. (105 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (16 resets) in 60 ms. (65 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (20 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (15 resets) in 33 ms. (117 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (16 resets) in 31 ms. (125 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (18 resets) in 32 ms. (121 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (16 resets) in 34 ms. (114 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (19 resets) in 47 ms. (83 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (19 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (13 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (15 resets) in 36 ms. (108 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (16 resets) in 25 ms. (153 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (18 resets) in 28 ms. (138 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (17 resets) in 34 ms. (114 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (16 resets) in 33 ms. (117 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (18 resets) in 45 ms. (87 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (15 resets) in 28 ms. (138 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (19 resets) in 33 ms. (117 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (19 resets) in 33 ms. (117 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
// Phase 1: matrix 138 rows 195 cols
[2025-05-31 01:01:52] [INFO ] Computed 59 invariants in 42 ms
[2025-05-31 01:01:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 48/110 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 48/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 55/165 variables, 34/151 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 55/206 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 22/187 variables, 18/224 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 22/246 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 137/324 variables, 187/433 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 9/333 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 8/450 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 95.0 379.0))
(s1 (/ 275.0 379.0))
(s2 (/ 1.0 758.0))
(s3 (/ 1.0 758.0))
(s4 (/ 1.0 758.0))
(s5 (/ 1.0 758.0))
(s6 (/ 1.0 758.0))
(s7 (/ 1.0 758.0))
(s8 (/ 1.0 758.0))
(s9 (/ 1.0 758.0))
(s10 (/ 1.0 758.0))
(s11 (/ 1.0 758.0))
(s12 (/ 1.0 758.0))
(s13 (/ 1.0 758.0))
(s14 (/ 1.0 758.0))
(s15 (/ 1.0 758.0))
(s16 (/ 1.0 758.0))
(s17 (/ 1.0 758.0))
(s18 (/ 1.0 758.0))
(s19 (/ 1.0 758.0))
(s20 0.0)
(s21 (/ 165.0 758.0))
(s22 (/ 1.0 758.0))
(s23 (/ 1.0 758.0))
(s24 (/ 1.0 758.0))
(s25 (/ 1.0 758.0))
(s26 (/ 1.0 758.0))
(s27 (/ 1.0 758.0))
(s28 (/ 1.0 758.0))
(s29 (/ 1.0 758.0))
(s30 (/ 1.0 758.0))
(s31 (/ 1.0 758.0))
(s32 (/ 1.0 758.0))
(s33 (/ 1.0 758.0))
(s34 (/ 1.0 758.0))
(s35 (/ 1.0 758.0))
(s36 (/ 1.0 758.0))
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 (/ 194.0 379.0))
(s41 (/ 2377.0 3790.0))
(s42 (/ 1.0 758.0))
(s43 (/ 1.0 758.0))
(s44 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/333 variables, and 450 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5077 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 195/195 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 48/110 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 48/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 55/165 variables, 34/151 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 55/206 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-05-31 01:01:59] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 22/187 variables, 18/225 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 22/247 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 137/324 variables, 187/434 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 62/497 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-05-31 01:02:01] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2025-05-31 01:02:01] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-05-31 01:02:01] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/333 variables, and 500 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5012 ms.
Refiners :[Domain max(s): 187/195 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/195 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
After SMT, in 10224ms problems are : Problem set: 0 solved, 62 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 138/138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 194 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 194 transition count 135
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 194 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 193 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 192 transition count 134
Applied a total of 10 rules in 87 ms. Remains 192 /195 variables (removed 3) and now considering 134/138 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 192/195 places, 134/138 transitions.
RANDOM walk for 4000000 steps (54548 resets) in 30782 ms. (129 steps per ms) remains 51/62 properties
BEST_FIRST walk for 400004 steps (902 resets) in 777 ms. (514 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (914 resets) in 758 ms. (527 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (908 resets) in 764 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (884 resets) in 760 ms. (525 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (915 resets) in 769 ms. (519 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (920 resets) in 768 ms. (520 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (900 resets) in 763 ms. (523 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (946 resets) in 765 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (880 resets) in 756 ms. (528 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (897 resets) in 761 ms. (524 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (900 resets) in 760 ms. (525 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (907 resets) in 764 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (916 resets) in 764 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (912 resets) in 855 ms. (467 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (916 resets) in 763 ms. (523 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (896 resets) in 769 ms. (519 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (915 resets) in 1097 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (918 resets) in 872 ms. (458 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (895 resets) in 759 ms. (526 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (911 resets) in 769 ms. (519 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (901 resets) in 766 ms. (521 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (913 resets) in 761 ms. (524 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (930 resets) in 768 ms. (520 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (903 resets) in 761 ms. (524 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (891 resets) in 764 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (897 resets) in 759 ms. (526 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (939 resets) in 766 ms. (521 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (903 resets) in 766 ms. (521 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (917 resets) in 762 ms. (524 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (875 resets) in 764 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (886 resets) in 761 ms. (524 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (887 resets) in 774 ms. (516 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (872 resets) in 761 ms. (524 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (890 resets) in 759 ms. (526 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400001 steps (912 resets) in 762 ms. (524 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (922 resets) in 767 ms. (520 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (888 resets) in 774 ms. (516 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (907 resets) in 763 ms. (523 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (904 resets) in 757 ms. (527 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (904 resets) in 757 ms. (527 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (912 resets) in 759 ms. (526 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (912 resets) in 765 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (912 resets) in 757 ms. (527 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (907 resets) in 765 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (888 resets) in 760 ms. (525 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (911 resets) in 759 ms. (526 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (892 resets) in 755 ms. (529 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (899 resets) in 759 ms. (526 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (918 resets) in 765 ms. (522 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (922 resets) in 757 ms. (527 steps per ms) remains 51/51 properties
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:02:21] [INFO ] Computed 60 invariants in 7 ms
[2025-05-31 01:02:21] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 53/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 35/139 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 25/164 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 7/171 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 122/293 variables, 171/226 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 23/316 variables, 11/239 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (OVERLAPS) 1/317 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/317 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 18 (OVERLAPS) 9/326 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 20 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 51 unsolved in 4867 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 53/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 35/139 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 25/164 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 7/171 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 122/293 variables, 171/226 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 41/269 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 01:02:29] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 3 ms to minimize.
[2025-05-31 01:02:29] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2025-05-31 01:02:29] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2025-05-31 01:02:29] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 01:02:30] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2025-05-31 01:02:30] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2025-05-31 01:02:30] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 01:02:33] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/293 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 16 (OVERLAPS) 23/316 variables, 11/288 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/316 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/316 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 01:02:39] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/316 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 01:02:41] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2025-05-31 01:02:41] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/316 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/316 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 22 (OVERLAPS) 1/317 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/317 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 01:02:46] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/317 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/317 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 26 (OVERLAPS) 9/326 variables, 9/317 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 01:02:50] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 4 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 29 (OVERLAPS) 0/326 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 318 constraints, problems are : Problem set: 0 solved, 51 unsolved in 29621 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 13/13 constraints]
After SMT, in 34517ms problems are : Problem set: 0 solved, 51 unsolved
Fused 51 Parikh solutions to 50 different solutions.
Parikh walk visited 9 properties in 9994 ms.
Support contains 42 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 4000000 steps (54467 resets) in 27146 ms. (147 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (913 resets) in 745 ms. (536 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (919 resets) in 734 ms. (544 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (897 resets) in 735 ms. (543 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (920 resets) in 738 ms. (541 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400002 steps (901 resets) in 742 ms. (538 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (901 resets) in 735 ms. (543 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400002 steps (900 resets) in 741 ms. (539 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (908 resets) in 738 ms. (541 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (890 resets) in 736 ms. (542 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (892 resets) in 736 ms. (542 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400002 steps (888 resets) in 738 ms. (541 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (885 resets) in 742 ms. (538 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (907 resets) in 716 ms. (557 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (914 resets) in 725 ms. (550 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (871 resets) in 715 ms. (558 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (897 resets) in 730 ms. (547 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (928 resets) in 722 ms. (553 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (893 resets) in 719 ms. (555 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (924 resets) in 718 ms. (556 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (911 resets) in 720 ms. (554 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (922 resets) in 717 ms. (557 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (914 resets) in 725 ms. (550 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (912 resets) in 719 ms. (555 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (902 resets) in 718 ms. (556 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (931 resets) in 722 ms. (553 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (907 resets) in 716 ms. (557 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (909 resets) in 718 ms. (556 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (898 resets) in 716 ms. (557 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (896 resets) in 727 ms. (549 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (913 resets) in 900 ms. (443 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (900 resets) in 936 ms. (426 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (912 resets) in 1014 ms. (394 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400002 steps (934 resets) in 942 ms. (424 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (921 resets) in 955 ms. (418 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400002 steps (899 resets) in 775 ms. (515 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400001 steps (892 resets) in 727 ms. (549 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (898 resets) in 748 ms. (534 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (883 resets) in 956 ms. (417 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (912 resets) in 862 ms. (463 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (923 resets) in 713 ms. (560 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (910 resets) in 718 ms. (556 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (907 resets) in 713 ms. (560 steps per ms) remains 42/42 properties
Interrupted probabilistic random walk after 8269091 steps, run timeout after 48001 ms. (steps per millisecond=172 ) properties seen :0 out of 42
Probabilistic random walk after 8269091 steps, saw 1051190 distinct states, run finished after 48010 ms. (steps per millisecond=172 ) properties seen :0
[2025-05-31 01:04:10] [INFO ] Invariant cache hit.
[2025-05-31 01:04:10] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 61/103 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 35/138 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 25/163 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 7/170 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 121/291 variables, 170/225 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 24/315 variables, 11/238 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 1/316 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/316 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/316 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 18 (OVERLAPS) 10/326 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 20 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 42 unsolved in 3705 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 61/103 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 35/138 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 25/163 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 7/170 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 121/291 variables, 170/225 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 33/260 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-31 01:04:16] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 6 ms to minimize.
[2025-05-31 01:04:16] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2025-05-31 01:04:16] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-31 01:04:17] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2025-05-31 01:04:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 24/315 variables, 11/276 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 9/289 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-31 01:04:22] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-31 01:04:24] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/315 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 21 (OVERLAPS) 1/316 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/316 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/316 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 24 (OVERLAPS) 10/326 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-31 01:04:31] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/326 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-31 01:04:33] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
[2025-05-31 01:04:34] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/326 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-31 01:04:36] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 30 (OVERLAPS) 0/326 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 307 constraints, problems are : Problem set: 0 solved, 42 unsolved in 25187 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 11/11 constraints]
After SMT, in 28907ms problems are : Problem set: 0 solved, 42 unsolved
Parikh walk visited 0 properties in 7861 ms.
Support contains 42 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:04:47] [INFO ] Invariant cache hit.
[2025-05-31 01:04:47] [INFO ] Implicit Places using invariants in 338 ms returned []
[2025-05-31 01:04:47] [INFO ] Invariant cache hit.
[2025-05-31 01:04:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:04:48] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2025-05-31 01:04:48] [INFO ] Redundant transitions in 6 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:04:48] [INFO ] Invariant cache hit.
[2025-05-31 01:04:48] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:04:52] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 3 ms to minimize.
[2025-05-31 01:04:52] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2025-05-31 01:04:53] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:04:54] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2025-05-31 01:04:54] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2025-05-31 01:04:55] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 1/326 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:04:58] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:05:00] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2025-05-31 01:05:00] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:05:01] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/326 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 264 constraints, problems are : Problem set: 0 solved, 131 unsolved in 17123 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/394 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:05:10] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2025-05-31 01:05:11] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:05:21] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2025-05-31 01:05:21] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2025-05-31 01:05:21] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/326 variables, and 399 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 15/15 constraints]
After SMT, in 47300ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 47309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48234 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 400000 steps (5409 resets) in 4926 ms. (81 steps per ms) remains 42/42 properties
Running SMT prover for 42 properties.
[2025-05-31 01:05:37] [INFO ] Invariant cache hit.
[2025-05-31 01:05:37] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-31 01:05:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 01:05:37] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :42
[2025-05-31 01:05:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:05:37] [INFO ] After 65ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :42
TRAPS : Iteration 0
[2025-05-31 01:05:37] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2025-05-31 01:05:37] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-05-31 01:05:38] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 01:05:39] [INFO ] After 1616ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :8 real:34
[2025-05-31 01:05:39] [INFO ] After 1953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :8 real:34
[2025-05-31 01:05:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-31 01:05:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2025-05-31 01:05:39] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :42
[2025-05-31 01:05:39] [INFO ] After 114ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :42
TRAPS : Iteration 0
[2025-05-31 01:05:40] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2025-05-31 01:05:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2025-05-31 01:05:40] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2025-05-31 01:05:40] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2025-05-31 01:05:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2025-05-31 01:05:40] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2025-05-31 01:05:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
TRAPS : Iteration 1
[2025-05-31 01:05:41] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 4 ms to minimize.
[2025-05-31 01:05:41] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 3 ms to minimize.
[2025-05-31 01:05:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
TRAPS : Iteration 2
[2025-05-31 01:05:43] [INFO ] After 3555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :42
[2025-05-31 01:05:43] [INFO ] After 4073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :42
RANDOM walk for 4000000 steps (54707 resets) in 26821 ms. (149 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400003 steps (900 resets) in 720 ms. (554 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (912 resets) in 708 ms. (564 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (925 resets) in 720 ms. (554 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (919 resets) in 708 ms. (564 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (893 resets) in 714 ms. (559 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (905 resets) in 708 ms. (564 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (923 resets) in 716 ms. (557 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (891 resets) in 705 ms. (566 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (906 resets) in 714 ms. (559 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (892 resets) in 707 ms. (564 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (920 resets) in 708 ms. (564 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (885 resets) in 711 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (915 resets) in 708 ms. (564 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (918 resets) in 716 ms. (557 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (924 resets) in 709 ms. (563 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (901 resets) in 712 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (900 resets) in 706 ms. (565 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (927 resets) in 713 ms. (560 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (918 resets) in 711 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (934 resets) in 716 ms. (557 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (908 resets) in 712 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (901 resets) in 707 ms. (564 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (925 resets) in 702 ms. (568 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (901 resets) in 701 ms. (569 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (904 resets) in 699 ms. (571 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (912 resets) in 703 ms. (568 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (866 resets) in 711 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (890 resets) in 712 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (904 resets) in 714 ms. (559 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (912 resets) in 712 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (921 resets) in 718 ms. (556 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (888 resets) in 717 ms. (557 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (917 resets) in 712 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (888 resets) in 711 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (914 resets) in 711 ms. (561 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (915 resets) in 708 ms. (564 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (913 resets) in 714 ms. (559 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (934 resets) in 714 ms. (559 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (901 resets) in 714 ms. (559 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (898 resets) in 709 ms. (563 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (931 resets) in 715 ms. (558 steps per ms) remains 41/41 properties
Interrupted probabilistic random walk after 7065158 steps, run timeout after 42001 ms. (steps per millisecond=168 ) properties seen :0 out of 41
Probabilistic random walk after 7065158 steps, saw 908692 distinct states, run finished after 42001 ms. (steps per millisecond=168 ) properties seen :0
[2025-05-31 01:06:39] [INFO ] Invariant cache hit.
[2025-05-31 01:06:39] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 61/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 35/137 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 25/162 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 7/169 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 120/289 variables, 169/224 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 25/314 variables, 11/237 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 1/315 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 18 (OVERLAPS) 11/326 variables, 11/254 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 20 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 41 unsolved in 3704 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 61/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 35/137 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 25/162 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 7/169 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 120/289 variables, 169/224 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 33/259 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-31 01:06:45] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2025-05-31 01:06:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-31 01:06:46] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-31 01:06:47] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2025-05-31 01:06:47] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2025-05-31 01:06:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 16 (OVERLAPS) 25/314 variables, 11/276 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/314 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/314 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-31 01:06:50] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/314 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 21 (OVERLAPS) 1/315 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/315 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-31 01:06:54] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-05-31 01:06:54] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/315 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/315 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 25 (OVERLAPS) 11/326 variables, 11/304 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-31 01:06:56] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2025-05-31 01:06:56] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
[2025-05-31 01:06:57] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-31 01:06:57] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-31 01:07:00] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/326 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 31 (OVERLAPS) 0/326 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 309 constraints, problems are : Problem set: 0 solved, 41 unsolved in 22553 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 14/14 constraints]
After SMT, in 26275ms problems are : Problem set: 0 solved, 41 unsolved
Parikh walk visited 4 properties in 7569 ms.
Support contains 37 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 16 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 4000000 steps (54607 resets) in 25620 ms. (156 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (907 resets) in 701 ms. (569 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (907 resets) in 698 ms. (572 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (909 resets) in 695 ms. (574 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (912 resets) in 705 ms. (566 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (886 resets) in 696 ms. (573 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (917 resets) in 698 ms. (572 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (910 resets) in 689 ms. (579 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (947 resets) in 699 ms. (571 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (916 resets) in 689 ms. (579 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (885 resets) in 687 ms. (581 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (913 resets) in 683 ms. (584 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (893 resets) in 834 ms. (479 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (897 resets) in 926 ms. (431 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (937 resets) in 694 ms. (575 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (912 resets) in 691 ms. (578 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (911 resets) in 683 ms. (584 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (913 resets) in 693 ms. (576 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (901 resets) in 683 ms. (584 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (925 resets) in 806 ms. (495 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (893 resets) in 922 ms. (433 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (913 resets) in 917 ms. (435 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (904 resets) in 882 ms. (453 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (902 resets) in 689 ms. (579 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (915 resets) in 682 ms. (585 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (891 resets) in 688 ms. (580 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (914 resets) in 680 ms. (587 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (902 resets) in 684 ms. (583 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (891 resets) in 681 ms. (586 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (916 resets) in 688 ms. (580 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (931 resets) in 683 ms. (584 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (903 resets) in 682 ms. (585 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (908 resets) in 691 ms. (578 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (911 resets) in 698 ms. (572 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (894 resets) in 703 ms. (568 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (925 resets) in 694 ms. (575 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (897 resets) in 693 ms. (576 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (892 resets) in 687 ms. (581 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 6852626 steps, run timeout after 42001 ms. (steps per millisecond=163 ) properties seen :0 out of 37
Probabilistic random walk after 6852626 steps, saw 882579 distinct states, run finished after 42002 ms. (steps per millisecond=163 ) properties seen :0
[2025-05-31 01:08:09] [INFO ] Invariant cache hit.
[2025-05-31 01:08:09] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 62/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 35/134 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 25/159 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 7/166 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 117/283 variables, 166/221 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 28/311 variables, 11/234 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 1/312 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/312 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/312 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (OVERLAPS) 14/326 variables, 14/254 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3768 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 62/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 35/134 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 01:08:14] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 25/159 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 7/166 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 117/283 variables, 166/222 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 32/256 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 01:08:15] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 01:08:16] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2025-05-31 01:08:17] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (OVERLAPS) 28/311 variables, 11/270 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/311 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/311 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 01:08:20] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2025-05-31 01:08:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/311 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/311 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (OVERLAPS) 1/312 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/312 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 01:08:23] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2025-05-31 01:08:23] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/312 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/312 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (OVERLAPS) 14/326 variables, 14/299 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 01:08:26] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2025-05-31 01:08:26] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2025-05-31 01:08:26] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 28 (OVERLAPS) 0/326 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 302 constraints, problems are : Problem set: 0 solved, 37 unsolved in 16518 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 11/11 constraints]
After SMT, in 20299ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 36 different solutions.
Parikh walk visited 0 properties in 7202 ms.
Support contains 37 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 23 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:08:37] [INFO ] Invariant cache hit.
[2025-05-31 01:08:37] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-31 01:08:37] [INFO ] Invariant cache hit.
[2025-05-31 01:08:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:08:37] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2025-05-31 01:08:37] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:08:37] [INFO ] Invariant cache hit.
[2025-05-31 01:08:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:08:41] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 3 ms to minimize.
[2025-05-31 01:08:41] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-31 01:08:42] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:08:43] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2025-05-31 01:08:43] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2025-05-31 01:08:44] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 1/326 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:08:47] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:08:49] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2025-05-31 01:08:49] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:08:51] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/326 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 264 constraints, problems are : Problem set: 0 solved, 131 unsolved in 18497 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/394 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:09:01] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
[2025-05-31 01:09:02] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:09:12] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2025-05-31 01:09:12] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2025-05-31 01:09:13] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/326 variables, and 399 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 15/15 constraints]
After SMT, in 48576ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 48579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49152 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 400000 steps (5434 resets) in 3408 ms. (117 steps per ms) remains 37/37 properties
Running SMT prover for 37 properties.
[2025-05-31 01:09:27] [INFO ] Invariant cache hit.
[2025-05-31 01:09:27] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-31 01:09:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 01:09:27] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :37
[2025-05-31 01:09:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:09:27] [INFO ] After 75ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :37
TRAPS : Iteration 0
[2025-05-31 01:09:28] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 01:09:28] [INFO ] After 785ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:33
[2025-05-31 01:09:28] [INFO ] After 1073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:33
[2025-05-31 01:09:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2025-05-31 01:09:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-31 01:09:29] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :37
[2025-05-31 01:09:29] [INFO ] After 105ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :37
TRAPS : Iteration 0
[2025-05-31 01:09:29] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2025-05-31 01:09:29] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 3 ms to minimize.
[2025-05-31 01:09:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2025-05-31 01:09:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2025-05-31 01:09:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-05-31 01:09:30] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2025-05-31 01:09:30] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-05-31 01:09:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
TRAPS : Iteration 1
[2025-05-31 01:09:31] [INFO ] After 2068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :37
[2025-05-31 01:09:31] [INFO ] After 2583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :37
RANDOM walk for 40000 steps (541 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1385600 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1385600 steps, saw 193618 distinct states, run finished after 3004 ms. (steps per millisecond=461 ) properties seen :0
[2025-05-31 01:09:34] [INFO ] Invariant cache hit.
[2025-05-31 01:09:34] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:09:34] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 314 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 25 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (551 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (89 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1321037 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 1
Probabilistic random walk after 1321037 steps, saw 184387 distinct states, run finished after 3002 ms. (steps per millisecond=440 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:09:38] [INFO ] Computed 60 invariants in 7 ms
[2025-05-31 01:09:38] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/284 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:09:38] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2025-05-31 01:09:38] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 693ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 307 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:09:39] [INFO ] Invariant cache hit.
[2025-05-31 01:09:39] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-05-31 01:09:39] [INFO ] Invariant cache hit.
[2025-05-31 01:09:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:09:40] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2025-05-31 01:09:40] [INFO ] Redundant transitions in 4 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:09:40] [INFO ] Invariant cache hit.
[2025-05-31 01:09:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:09:44] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2025-05-31 01:09:44] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2025-05-31 01:09:45] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2025-05-31 01:09:45] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2025-05-31 01:09:45] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2025-05-31 01:09:45] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:09:46] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2025-05-31 01:09:47] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 3 ms to minimize.
[2025-05-31 01:09:47] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2025-05-31 01:09:47] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2025-05-31 01:09:47] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:09:50] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 15162 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:10:24] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 45234ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 45238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46106 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 23 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:10:25] [INFO ] Computed 60 invariants in 17 ms
[2025-05-31 01:10:25] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:10:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2025-05-31 01:10:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-31 01:10:25] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:10:25] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:10:25] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 423 ms.
RANDOM walk for 40000 steps (542 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1342159 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :0 out of 1
Probabilistic random walk after 1342159 steps, saw 187515 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:10:29] [INFO ] Computed 60 invariants in 20 ms
[2025-05-31 01:10:29] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:29] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 952 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=317 )
Parikh walk visited 1 properties in 9 ms.
RANDOM walk for 40000 steps (566 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (87 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1252418 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 1
Probabilistic random walk after 1252418 steps, saw 175078 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
[2025-05-31 01:10:32] [INFO ] Invariant cache hit.
[2025-05-31 01:10:32] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:33] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2025-05-31 01:10:33] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:33] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 22/306 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/326 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:33] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/326 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1000ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 313 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 22 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (548 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1198689 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :0 out of 1
Probabilistic random walk after 1198689 steps, saw 167816 distinct states, run finished after 3002 ms. (steps per millisecond=399 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:10:37] [INFO ] Computed 60 invariants in 7 ms
[2025-05-31 01:10:37] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/284 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 22/307 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 19/326 variables, 19/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77359 steps, including 509 resets, run visited all 1 properties in 310 ms. (steps per millisecond=249 )
Parikh walk visited 1 properties in 310 ms.
RANDOM walk for 40000 steps (540 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (95 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1402707 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1402707 steps, saw 195995 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:10:41] [INFO ] Computed 60 invariants in 5 ms
[2025-05-31 01:10:41] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:41] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 833 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=208 )
Parikh walk visited 1 properties in 4 ms.
RANDOM walk for 40000 steps (539 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (93 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1326010 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :0 out of 1
Probabilistic random walk after 1326010 steps, saw 185116 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
[2025-05-31 01:10:44] [INFO ] Invariant cache hit.
[2025-05-31 01:10:44] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:45] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:45] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/283 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/306 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 20/326 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 699ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 879 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=293 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (554 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1251220 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 1
Probabilistic random walk after 1251220 steps, saw 174926 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
[2025-05-31 01:10:48] [INFO ] Invariant cache hit.
[2025-05-31 01:10:48] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:49] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:49] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/306 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 20/326 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 842ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2082 steps, including 4 resets, run visited all 1 properties in 10 ms. (steps per millisecond=208 )
Parikh walk visited 1 properties in 9 ms.
RANDOM walk for 40000 steps (551 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (89 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1233685 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :0 out of 1
Probabilistic random walk after 1233685 steps, saw 172619 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
[2025-05-31 01:10:52] [INFO ] Invariant cache hit.
[2025-05-31 01:10:52] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:52] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:53] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/283 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/306 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 20/326 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 785ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 727 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=242 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (545 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (91 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1131848 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 1
Probabilistic random walk after 1131848 steps, saw 158439 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2025-05-31 01:10:56] [INFO ] Invariant cache hit.
[2025-05-31 01:10:56] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:56] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:10:57] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/306 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 20/326 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6686 steps, including 16 resets, run visited all 1 properties in 28 ms. (steps per millisecond=238 )
Parikh walk visited 1 properties in 28 ms.
RANDOM walk for 40000 steps (537 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (87 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1171166 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 1
Probabilistic random walk after 1171166 steps, saw 164125 distinct states, run finished after 3001 ms. (steps per millisecond=390 ) properties seen :0
[2025-05-31 01:11:00] [INFO ] Invariant cache hit.
[2025-05-31 01:11:00] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:00] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 643 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=321 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (545 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (90 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1359756 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1359756 steps, saw 190167 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2025-05-31 01:11:04] [INFO ] Invariant cache hit.
[2025-05-31 01:11:04] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:04] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9944 steps, including 28 resets, run visited all 1 properties in 26 ms. (steps per millisecond=382 )
Parikh walk visited 1 properties in 26 ms.
RANDOM walk for 40000 steps (535 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (90 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1346701 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 1
Probabilistic random walk after 1346701 steps, saw 188149 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2025-05-31 01:11:07] [INFO ] Invariant cache hit.
[2025-05-31 01:11:07] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:07] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 499ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 503 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=251 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (560 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (93 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1407853 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :0 out of 1
Probabilistic random walk after 1407853 steps, saw 196715 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
[2025-05-31 01:11:11] [INFO ] Invariant cache hit.
[2025-05-31 01:11:11] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:11] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18329 steps, including 67 resets, run visited all 1 properties in 46 ms. (steps per millisecond=398 )
Parikh walk visited 1 properties in 47 ms.
RANDOM walk for 40000 steps (560 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (89 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1350715 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :0 out of 1
Probabilistic random walk after 1350715 steps, saw 188843 distinct states, run finished after 3003 ms. (steps per millisecond=449 ) properties seen :0
[2025-05-31 01:11:14] [INFO ] Invariant cache hit.
[2025-05-31 01:11:14] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:15] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 962 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=320 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (550 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (86 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1365696 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :0 out of 1
Probabilistic random walk after 1365696 steps, saw 191010 distinct states, run finished after 3005 ms. (steps per millisecond=454 ) properties seen :0
[2025-05-31 01:11:18] [INFO ] Invariant cache hit.
[2025-05-31 01:11:18] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:18] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:18] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/283 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:18] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:18] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/284 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/306 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/306 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 20/326 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/326 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25273 steps, including 85 resets, run visited all 1 properties in 59 ms. (steps per millisecond=428 )
Parikh walk visited 1 properties in 58 ms.
RANDOM walk for 40000 steps (545 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (80 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1210706 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 1
Probabilistic random walk after 1210706 steps, saw 169554 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
[2025-05-31 01:11:22] [INFO ] Invariant cache hit.
[2025-05-31 01:11:22] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:22] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 22/306 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/326 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/326 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 754ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10380 steps, including 31 resets, run visited all 1 properties in 41 ms. (steps per millisecond=253 )
Parikh walk visited 1 properties in 42 ms.
RANDOM walk for 40000 steps (539 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1332022 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1332022 steps, saw 185954 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2025-05-31 01:11:25] [INFO ] Invariant cache hit.
[2025-05-31 01:11:25] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2025-05-31 01:11:26] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2025-05-31 01:11:26] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:26] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 22/306 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/326 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/326 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11409 steps, including 35 resets, run visited all 1 properties in 45 ms. (steps per millisecond=253 )
Parikh walk visited 1 properties in 45 ms.
RANDOM walk for 40000 steps (547 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (88 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1125616 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :0 out of 1
Probabilistic random walk after 1125616 steps, saw 157500 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
[2025-05-31 01:11:29] [INFO ] Invariant cache hit.
[2025-05-31 01:11:29] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:30] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:30] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 22/306 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/326 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/326 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 786ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 34716 steps, including 118 resets, run visited all 1 properties in 134 ms. (steps per millisecond=259 )
Parikh walk visited 1 properties in 135 ms.
RANDOM walk for 40000 steps (547 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (100 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1193730 steps, run timeout after 3001 ms. (steps per millisecond=397 ) properties seen :0 out of 1
Probabilistic random walk after 1193730 steps, saw 167025 distinct states, run finished after 3001 ms. (steps per millisecond=397 ) properties seen :0
[2025-05-31 01:11:33] [INFO ] Invariant cache hit.
[2025-05-31 01:11:33] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:34] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:34] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/283 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:34] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/284 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/306 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/306 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 20/326 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/326 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5308 steps, including 16 resets, run visited all 1 properties in 13 ms. (steps per millisecond=408 )
Parikh walk visited 1 properties in 12 ms.
RANDOM walk for 40000 steps (560 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (90 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1491355 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :0 out of 1
Probabilistic random walk after 1491355 steps, saw 207989 distinct states, run finished after 3001 ms. (steps per millisecond=496 ) properties seen :0
[2025-05-31 01:11:37] [INFO ] Invariant cache hit.
[2025-05-31 01:11:37] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:37] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:37] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/283 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:38] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:38] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/284 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/306 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/306 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 20/326 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/326 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 805ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7738 steps, including 23 resets, run visited all 1 properties in 31 ms. (steps per millisecond=249 )
Parikh walk visited 1 properties in 30 ms.
RANDOM walk for 40000 steps (538 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (92 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1206481 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :0 out of 1
Probabilistic random walk after 1206481 steps, saw 168948 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :0
[2025-05-31 01:11:41] [INFO ] Invariant cache hit.
[2025-05-31 01:11:41] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:41] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2025-05-31 01:11:41] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:41] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2025-05-31 01:11:42] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:42] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 22/306 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/326 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/326 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 867ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 29187 steps, including 167 resets, run visited all 1 properties in 88 ms. (steps per millisecond=331 )
Parikh walk visited 1 properties in 87 ms.
RANDOM walk for 40000 steps (544 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1213852 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 1
Probabilistic random walk after 1213852 steps, saw 170042 distinct states, run finished after 3001 ms. (steps per millisecond=404 ) properties seen :0
[2025-05-31 01:11:45] [INFO ] Invariant cache hit.
[2025-05-31 01:11:45] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:45] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 579 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=193 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (556 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (91 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1370059 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :0 out of 1
Probabilistic random walk after 1370059 steps, saw 191598 distinct states, run finished after 3001 ms. (steps per millisecond=456 ) properties seen :0
[2025-05-31 01:11:49] [INFO ] Invariant cache hit.
[2025-05-31 01:11:49] [INFO ] State equation strengthened by 2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 93/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/129 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:49] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:49] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/283 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/284 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:11:49] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/284 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/306 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/306 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 20/326 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/326 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 787ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 848 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=169 )
Parikh walk visited 1 properties in 4 ms.
RANDOM walk for 40000 steps (538 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (81 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1170010 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :0 out of 1
Probabilistic random walk after 1170010 steps, saw 163986 distinct states, run finished after 3009 ms. (steps per millisecond=388 ) properties seen :0
[2025-05-31 01:11:52] [INFO ] Invariant cache hit.
[2025-05-31 01:11:52] [INFO ] State equation strengthened by 2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/60 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/66 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/142 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/142 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/178 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/210 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 9/219 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 107/326 variables, 161/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/48 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/60 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/62 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/66 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 76/142 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/142 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/178 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 32/210 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/219 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 107/326 variables, 161/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 126 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (542 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (97 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1340848 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1340848 steps, saw 187327 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
[2025-05-31 01:11:56] [INFO ] Invariant cache hit.
[2025-05-31 01:11:56] [INFO ] State equation strengthened by 2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/60 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/66 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/142 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/142 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/178 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/210 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 9/219 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 107/326 variables, 161/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/48 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/60 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/62 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/66 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 76/142 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/142 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/178 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 32/210 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/219 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 107/326 variables, 161/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 211 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:11:57] [INFO ] Invariant cache hit.
[2025-05-31 01:11:57] [INFO ] Implicit Places using invariants in 378 ms returned []
[2025-05-31 01:11:57] [INFO ] Invariant cache hit.
[2025-05-31 01:11:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:11:58] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
[2025-05-31 01:11:58] [INFO ] Redundant transitions in 6 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:11:58] [INFO ] Invariant cache hit.
[2025-05-31 01:11:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:12:02] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2025-05-31 01:12:02] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2025-05-31 01:12:03] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:12:04] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2025-05-31 01:12:04] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 4 ms to minimize.
[2025-05-31 01:12:05] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 1/326 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:12:08] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:12:11] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2025-05-31 01:12:11] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:12:12] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/326 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 264 constraints, problems are : Problem set: 0 solved, 131 unsolved in 19135 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/394 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:12:22] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2025-05-31 01:12:23] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:12:32] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2025-05-31 01:12:32] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2025-05-31 01:12:32] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/326 variables, and 399 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 15/15 constraints]
After SMT, in 49210ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 49213ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50184 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:12:47] [INFO ] Invariant cache hit.
[2025-05-31 01:12:47] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:12:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2025-05-31 01:12:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2025-05-31 01:12:47] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:12:47] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:12:47] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 265 ms.
RANDOM walk for 40000 steps (546 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (90 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1401465 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :0 out of 1
Probabilistic random walk after 1401465 steps, saw 195787 distinct states, run finished after 3001 ms. (steps per millisecond=466 ) properties seen :0
[2025-05-31 01:12:50] [INFO ] Invariant cache hit.
[2025-05-31 01:12:50] [INFO ] State equation strengthened by 2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/48 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/60 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/66 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/142 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/142 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/178 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/210 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 9/219 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 107/326 variables, 161/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/48 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/60 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/62 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/66 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 76/142 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/142 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/178 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 32/210 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/219 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 107/326 variables, 161/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 463ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3005 steps, including 32 resets, run visited all 1 properties in 9 ms. (steps per millisecond=333 )
Parikh walk visited 1 properties in 8 ms.
RANDOM walk for 40000 steps (544 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (90 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1352508 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :0 out of 1
Probabilistic random walk after 1352508 steps, saw 189130 distinct states, run finished after 3001 ms. (steps per millisecond=450 ) properties seen :0
[2025-05-31 01:12:54] [INFO ] Invariant cache hit.
[2025-05-31 01:12:54] [INFO ] State equation strengthened by 2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/48 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/60 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/66 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/142 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/142 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/178 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/210 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 9/219 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 107/326 variables, 161/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/48 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/60 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/62 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/66 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 76/142 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/142 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/178 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 32/210 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/219 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 107/326 variables, 161/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 467ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 566 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=188 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (544 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (90 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1388074 steps, run timeout after 3001 ms. (steps per millisecond=462 ) properties seen :0 out of 1
Probabilistic random walk after 1388074 steps, saw 193936 distinct states, run finished after 3004 ms. (steps per millisecond=462 ) properties seen :0
[2025-05-31 01:12:57] [INFO ] Invariant cache hit.
[2025-05-31 01:12:57] [INFO ] State equation strengthened by 2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/48 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/60 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/66 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/142 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/142 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/178 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/210 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 9/219 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 107/326 variables, 161/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/48 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/60 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/62 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/66 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 76/142 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/142 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/178 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 32/210 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/219 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 107/326 variables, 161/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 453ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 627 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=209 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (544 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (83 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1344126 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :0 out of 1
Probabilistic random walk after 1344126 steps, saw 187807 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
[2025-05-31 01:13:01] [INFO ] Invariant cache hit.
[2025-05-31 01:13:01] [INFO ] State equation strengthened by 2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/48 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/60 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/66 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/142 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/142 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/178 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/210 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 9/219 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 107/326 variables, 161/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/48 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/60 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/62 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/66 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 76/142 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/142 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/178 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 32/210 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/219 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 107/326 variables, 161/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/326 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 447 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=223 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (536 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (86 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1412112 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :0 out of 1
Probabilistic random walk after 1412112 steps, saw 197302 distinct states, run finished after 3001 ms. (steps per millisecond=470 ) properties seen :0
[2025-05-31 01:13:04] [INFO ] Invariant cache hit.
[2025-05-31 01:13:04] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/283 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 22/306 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 20/326 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 14 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (526 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (91 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1330620 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1330620 steps, saw 185762 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:13:08] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:13:08] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:13:09] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 166 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:13:09] [INFO ] Invariant cache hit.
[2025-05-31 01:13:09] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-31 01:13:09] [INFO ] Invariant cache hit.
[2025-05-31 01:13:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:13:09] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2025-05-31 01:13:09] [INFO ] Redundant transitions in 2 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:13:09] [INFO ] Invariant cache hit.
[2025-05-31 01:13:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:13:14] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-05-31 01:13:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2025-05-31 01:13:14] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2025-05-31 01:13:14] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2025-05-31 01:13:14] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 6 ms to minimize.
[2025-05-31 01:13:14] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:13:16] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2025-05-31 01:13:16] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2025-05-31 01:13:16] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
[2025-05-31 01:13:16] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 3 ms to minimize.
[2025-05-31 01:13:16] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:13:19] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14162 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:13:51] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/326 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 44221ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 44224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44820 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 17 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:13:54] [INFO ] Computed 60 invariants in 5 ms
[2025-05-31 01:13:54] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:13:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-31 01:13:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2025-05-31 01:13:54] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:13:54] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:13:54] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 382 ms.
RANDOM walk for 40000 steps (554 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (87 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1374254 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :0 out of 1
Probabilistic random walk after 1374254 steps, saw 192093 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:13:57] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:13:57] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:13:57] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 133 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 33 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (560 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (88 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1382578 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :0 out of 1
Probabilistic random walk after 1382578 steps, saw 193208 distinct states, run finished after 3003 ms. (steps per millisecond=460 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:14:01] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:14:01] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:14:01] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:14:02] [INFO ] Invariant cache hit.
[2025-05-31 01:14:02] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-31 01:14:02] [INFO ] Invariant cache hit.
[2025-05-31 01:14:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:14:02] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2025-05-31 01:14:02] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:14:02] [INFO ] Invariant cache hit.
[2025-05-31 01:14:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:14:06] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2025-05-31 01:14:06] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2025-05-31 01:14:07] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2025-05-31 01:14:07] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2025-05-31 01:14:07] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 3 ms to minimize.
[2025-05-31 01:14:07] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:14:09] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 3 ms to minimize.
[2025-05-31 01:14:09] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2025-05-31 01:14:10] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 3 ms to minimize.
[2025-05-31 01:14:10] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2025-05-31 01:14:10] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:14:13] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14803 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:14:43] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/326 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 44864ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 44866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45494 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:14:47] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:14:47] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:14:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-31 01:14:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2025-05-31 01:14:47] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:14:47] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:14:47] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
RANDOM walk for 40000 steps (543 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (91 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1348169 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :0 out of 1
Probabilistic random walk after 1348169 steps, saw 188432 distinct states, run finished after 3002 ms. (steps per millisecond=449 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:14:51] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 01:14:51] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:14:51] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 524ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 21 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (555 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (85 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1351409 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :0 out of 1
Probabilistic random walk after 1351409 steps, saw 188945 distinct states, run finished after 3001 ms. (steps per millisecond=450 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:14:54] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:14:54] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:14:55] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:14:55] [INFO ] Invariant cache hit.
[2025-05-31 01:14:55] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-31 01:14:55] [INFO ] Invariant cache hit.
[2025-05-31 01:14:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:14:56] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2025-05-31 01:14:56] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:14:56] [INFO ] Invariant cache hit.
[2025-05-31 01:14:56] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:15:00] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2025-05-31 01:15:00] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2025-05-31 01:15:00] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2025-05-31 01:15:01] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2025-05-31 01:15:01] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2025-05-31 01:15:01] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:15:02] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2025-05-31 01:15:02] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2025-05-31 01:15:02] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2025-05-31 01:15:02] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2025-05-31 01:15:02] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:15:05] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14567 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:15:39] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 44637ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 44639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45278 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 13 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:15:40] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:15:40] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:15:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-31 01:15:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2025-05-31 01:15:41] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:15:41] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:15:41] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 376 ms.
RANDOM walk for 40000 steps (525 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1278202 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :0 out of 1
Probabilistic random walk after 1278202 steps, saw 178184 distinct states, run finished after 3001 ms. (steps per millisecond=425 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:15:44] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:15:44] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:15:44] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 186 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 17 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (540 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (95 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1375076 steps, run timeout after 3001 ms. (steps per millisecond=458 ) properties seen :0 out of 1
Probabilistic random walk after 1375076 steps, saw 192213 distinct states, run finished after 3001 ms. (steps per millisecond=458 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:15:48] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:15:48] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:15:48] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:15:48] [INFO ] Invariant cache hit.
[2025-05-31 01:15:48] [INFO ] Implicit Places using invariants in 317 ms returned []
[2025-05-31 01:15:48] [INFO ] Invariant cache hit.
[2025-05-31 01:15:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:15:49] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2025-05-31 01:15:49] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:15:49] [INFO ] Invariant cache hit.
[2025-05-31 01:15:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:15:55] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2025-05-31 01:15:55] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2025-05-31 01:15:55] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2025-05-31 01:15:56] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 5 ms to minimize.
[2025-05-31 01:15:56] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2025-05-31 01:15:56] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:15:58] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2025-05-31 01:15:58] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 3 ms to minimize.
[2025-05-31 01:15:58] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2025-05-31 01:15:58] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
[2025-05-31 01:15:58] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:16:01] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 16767 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:16:32] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/326 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 46841ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 46844ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47790 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:16:36] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:16:36] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:16:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-31 01:16:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 01:16:36] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:16:36] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:16:36] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 299 ms.
RANDOM walk for 40000 steps (541 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (86 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1358400 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :0 out of 1
Probabilistic random walk after 1358400 steps, saw 189968 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:16:39] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:16:39] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:16:40] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 514ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (539 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (92 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1408626 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :0 out of 1
Probabilistic random walk after 1408626 steps, saw 196831 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:16:43] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:16:43] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:16:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:16:44] [INFO ] Invariant cache hit.
[2025-05-31 01:16:44] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-31 01:16:44] [INFO ] Invariant cache hit.
[2025-05-31 01:16:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:16:44] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2025-05-31 01:16:44] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:16:44] [INFO ] Invariant cache hit.
[2025-05-31 01:16:44] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:16:48] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2025-05-31 01:16:48] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2025-05-31 01:16:48] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2025-05-31 01:16:49] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2025-05-31 01:16:49] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 3 ms to minimize.
[2025-05-31 01:16:49] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:16:50] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2025-05-31 01:16:50] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 3 ms to minimize.
[2025-05-31 01:16:50] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2025-05-31 01:16:51] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2025-05-31 01:16:51] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:16:54] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14473 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:17:27] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 44530ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 44531ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45176 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:17:29] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 01:17:29] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:17:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-31 01:17:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2025-05-31 01:17:29] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:17:29] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:17:29] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 453 ms.
RANDOM walk for 40000 steps (540 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (89 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1369584 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :0 out of 1
Probabilistic random walk after 1369584 steps, saw 191534 distinct states, run finished after 3001 ms. (steps per millisecond=456 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:17:32] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:17:32] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:17:33] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 177 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (537 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (85 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1433915 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 1
Probabilistic random walk after 1433915 steps, saw 200213 distinct states, run finished after 3001 ms. (steps per millisecond=477 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:17:36] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:17:36] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:17:36] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 156 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:17:37] [INFO ] Invariant cache hit.
[2025-05-31 01:17:37] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-05-31 01:17:37] [INFO ] Invariant cache hit.
[2025-05-31 01:17:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:17:38] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2025-05-31 01:17:38] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:17:38] [INFO ] Invariant cache hit.
[2025-05-31 01:17:38] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:17:43] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
[2025-05-31 01:17:43] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2025-05-31 01:17:43] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2025-05-31 01:17:44] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 3 ms to minimize.
[2025-05-31 01:17:44] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 3 ms to minimize.
[2025-05-31 01:17:44] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:17:45] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2025-05-31 01:17:45] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 3 ms to minimize.
[2025-05-31 01:17:45] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2025-05-31 01:17:45] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2025-05-31 01:17:46] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:17:49] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14494 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:18:17] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/326 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 1)
(s98 1)
(s99 0)
(s100 0)
(s101 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 44576ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 44579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45494 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:18:22] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:18:22] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:18:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2025-05-31 01:18:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2025-05-31 01:18:23] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:18:23] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:18:23] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 293 ms.
RANDOM walk for 40000 steps (543 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (82 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1449220 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1449220 steps, saw 202279 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:18:26] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:18:26] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:18:26] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (536 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (91 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1471387 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :0 out of 1
Probabilistic random walk after 1471387 steps, saw 205413 distinct states, run finished after 3001 ms. (steps per millisecond=490 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:18:29] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:18:29] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:18:30] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 148 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:18:30] [INFO ] Invariant cache hit.
[2025-05-31 01:18:30] [INFO ] Implicit Places using invariants in 271 ms returned []
[2025-05-31 01:18:30] [INFO ] Invariant cache hit.
[2025-05-31 01:18:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:18:31] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2025-05-31 01:18:31] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:18:31] [INFO ] Invariant cache hit.
[2025-05-31 01:18:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:18:34] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2025-05-31 01:18:35] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2025-05-31 01:18:35] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2025-05-31 01:18:35] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2025-05-31 01:18:35] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2025-05-31 01:18:35] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:18:36] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2025-05-31 01:18:36] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2025-05-31 01:18:37] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2025-05-31 01:18:37] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2025-05-31 01:18:37] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:18:39] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11955 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:19:08] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/326 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 42013ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 42014ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42640 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:19:13] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:19:13] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:19:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-31 01:19:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2025-05-31 01:19:13] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:19:13] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:19:13] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 264 ms.
RANDOM walk for 40000 steps (526 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (89 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1467437 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :0 out of 1
Probabilistic random walk after 1467437 steps, saw 204903 distinct states, run finished after 3001 ms. (steps per millisecond=488 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:19:16] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 01:19:16] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:19:16] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (542 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (92 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1468434 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :0 out of 1
Probabilistic random walk after 1468434 steps, saw 205046 distinct states, run finished after 3001 ms. (steps per millisecond=489 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:19:20] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:19:20] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:19:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:19:20] [INFO ] Invariant cache hit.
[2025-05-31 01:19:21] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-05-31 01:19:21] [INFO ] Invariant cache hit.
[2025-05-31 01:19:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:19:21] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2025-05-31 01:19:21] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:19:21] [INFO ] Invariant cache hit.
[2025-05-31 01:19:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:19:25] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2025-05-31 01:19:25] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2025-05-31 01:19:25] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2025-05-31 01:19:25] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2025-05-31 01:19:25] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2025-05-31 01:19:26] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:19:27] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
[2025-05-31 01:19:27] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2025-05-31 01:19:27] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2025-05-31 01:19:27] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2025-05-31 01:19:27] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:19:29] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11553 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:20:00] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 41615ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 41617ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42277 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:20:03] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:20:03] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:20:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2025-05-31 01:20:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 01:20:03] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:20:03] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:20:03] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 310 ms.
RANDOM walk for 40000 steps (550 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (100 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1403049 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1403049 steps, saw 196038 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:20:06] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:20:06] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:20:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 470ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (532 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (94 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1497040 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :0 out of 1
Probabilistic random walk after 1497040 steps, saw 208738 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:20:10] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:20:10] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:20:10] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 642ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:20:10] [INFO ] Invariant cache hit.
[2025-05-31 01:20:11] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-05-31 01:20:11] [INFO ] Invariant cache hit.
[2025-05-31 01:20:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:20:11] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2025-05-31 01:20:11] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:20:11] [INFO ] Invariant cache hit.
[2025-05-31 01:20:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:20:15] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2025-05-31 01:20:15] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2025-05-31 01:20:15] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 3 ms to minimize.
[2025-05-31 01:20:16] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 3 ms to minimize.
[2025-05-31 01:20:16] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
[2025-05-31 01:20:16] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:20:17] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2025-05-31 01:20:18] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 3 ms to minimize.
[2025-05-31 01:20:18] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2025-05-31 01:20:18] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2025-05-31 01:20:18] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:20:21] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 15022 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:20:53] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/326 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 45078ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 45082ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45982 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:20:56] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 01:20:56] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:20:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2025-05-31 01:20:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2025-05-31 01:20:57] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:20:57] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2025-05-31 01:20:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 1
[2025-05-31 01:20:57] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:20:57] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 527 ms.
RANDOM walk for 40000 steps (536 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (82 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1415711 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :0 out of 1
Probabilistic random walk after 1415711 steps, saw 197838 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:21:00] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 01:21:00] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/283 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/306 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/326 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:21:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/283 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/306 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/326 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 668ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (552 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (92 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1294034 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :0 out of 1
Probabilistic random walk after 1294034 steps, saw 180044 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:21:04] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 01:21:04] [INFO ] State equation strengthened by 2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 01:21:04] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 581ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-31 01:21:04] [INFO ] Invariant cache hit.
[2025-05-31 01:21:05] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-05-31 01:21:05] [INFO ] Invariant cache hit.
[2025-05-31 01:21:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:21:05] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2025-05-31 01:21:05] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 01:21:05] [INFO ] Invariant cache hit.
[2025-05-31 01:21:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:21:10] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2025-05-31 01:21:10] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2025-05-31 01:21:11] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2025-05-31 01:21:11] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 3 ms to minimize.
[2025-05-31 01:21:11] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2025-05-31 01:21:12] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:21:13] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2025-05-31 01:21:13] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 3 ms to minimize.
[2025-05-31 01:21:14] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2025-05-31 01:21:14] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2025-05-31 01:21:14] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:21:17] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 16658 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-31 01:21:50] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 46711ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 46714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47527 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:21:52] [INFO ] Computed 60 invariants in 2 ms
[2025-05-31 01:21:52] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 01:21:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-31 01:21:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2025-05-31 01:21:52] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:21:52] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:21:52] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 309 ms.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 37 properties.
// Phase 1: matrix 134 rows 192 cols
[2025-05-31 01:21:52] [INFO ] Computed 60 invariants in 1 ms
[2025-05-31 01:21:53] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2025-05-31 01:21:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2025-05-31 01:21:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-31 01:21:54] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :37
TRAPS : Iteration 0
[2025-05-31 01:21:54] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2025-05-31 01:21:54] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2025-05-31 01:21:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2025-05-31 01:21:55] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2025-05-31 01:21:55] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2025-05-31 01:21:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2025-05-31 01:21:55] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-05-31 01:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 1
[2025-05-31 01:21:55] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-05-31 01:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 2
[2025-05-31 01:21:56] [INFO ] After 2962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :37
[2025-05-31 01:21:57] [INFO ] After 4098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :37
Over-approximation ignoring read arcs solved 0 properties in 4401 ms.
Unable to solve all queries for examination StableMarking. Remains :37 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 37 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1207369 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-20a
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 195
TRANSITIONS: 152
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 742
NUPN UNITS: 60
LOADING TIME: 0.453
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.031
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.786
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2294
MODEL NAME: /home/mcc/execution/model
195 places, 152 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StableMarking FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1748654537172
--------------------
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 StableMarking -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="DES-PT-20a"
export BK_EXAMINATION="StableMarking"
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 DES-PT-20a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-smll-174854076400188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;