About the Execution of 2025-gold for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13422.712 | 1800000.00 | 3527076.00 | 3563.70 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r128-smll-177955743900183.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is EisenbergMcGuire-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-177955743900183
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 8.6K Mar 7 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 7 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 09:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 05:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 05:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 3 18:30 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 1779584831818
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2026-05-24 01:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-24 01:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 01:07:14] [INFO ] Load time of PNML (sax parser for PT used): 595 ms
[2026-05-24 01:07:14] [INFO ] Transformed 1090 places.
[2026-05-24 01:07:14] [INFO ] Transformed 5200 transitions.
[2026-05-24 01:07:14] [INFO ] Found NUPN structural information;
[2026-05-24 01:07:14] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 807 ms.
RANDOM walk for 40000 steps (8 resets) in 5027 ms. (7 steps per ms) remains 363/1090 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 363/363 properties
[2026-05-24 01:07:16] [INFO ] Flatten gal took : 713 ms
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 363/363 properties
[2026-05-24 01:07:16] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
[2026-05-24 01:07:17] [INFO ] Flatten gal took : 385 ms
// Phase 1: matrix 2330 rows 1090 cols
[2026-05-24 01:07:17] [INFO ] Computed 31 invariants in 46 ms
[2026-05-24 01:07:17] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2026-05-24 01:07:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9928868027558354819.gal : 242 ms
[2026-05-24 01:07:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2491631019819379728.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9928868027558354819.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2491631019819379728.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality2491631019819379728.prop.
Error getting values : (error "ParserException while parsing response: ((s363 (/ 1.0 2.0))
(s371 (/ 1.0 2.0))
(s381 (/ 1.0 2.0))
(s383 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s433 (/ 1.0 2.0))
(s434 (/ 1.0 2.0))
(s435 (/ 1.0 2.0))
(s436 (/ 1.0 2.0))
(s437 (/ 1.0 2.0))
(s438 (/ 1.0 2.0))
(s439 (/ 1.0 2.0))
(s440 (/ 1.0 2.0))
(s441 (/ 1.0 2.0))
(s442 (/ 1.0 2.0))
(s443 (/ 1.0 2.0))
(s444 (/ 1.0 2.0))
(s445 (/ 1.0 2.0))
(s446 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s449 (/ 1.0 2.0))
(s450 (/ 1.0 2.0))
(s451 (/ 1.0 2.0))
(s452 (/ 1.0 2.0))
(s453 (/ 1.0 2.0))
(s454 (/ 1.0 2.0))
(s455 (/ 1.0 2.0))
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s458 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s460 (/ 1.0 2.0))
(s461 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s464 (/ 1.0 2.0))
(s465 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s468 (/ 1.0 2.0))
(s469 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s471 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s473 (/ 1.0 2.0))
(s474 (/ 1.0 2.0))
(s475 (/ 1.0 2.0))
(s476 (/ 1.0 2.0))
(s477 (/ 1.0 2.0))
(s478 (/ 1.0 2.0))
(s479 (/ 1.0 2.0))
(s480 (/ 1.0 2.0))
(s481 (/ 1.0 2.0))
(s482 (/ 1.0 2.0))
(s483 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s485 (/ 1.0 2.0))
(s486 (/ 1.0 2.0))
(s487 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s490 (/ 1.0 2.0))
(s491 (/ 1.0 2.0))
(s492 (/ 1.0 2.0))
(s493 (/ 1.0 2.0))
(s494 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s498 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s500 (/ 1.0 2.0))
(s501 (/ 1.0 2.0))
(s502 (/ 1.0 2.0))
(s503 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s507 (/ 1.0 2.0))
(s508 (/ 1.0 2.0))
(s509 (/ 1.0 2.0))
(s510 (/ 1.0 2.0))
(s511 (/ 1.0 2.0))
(s512 (/ 1.0 2.0))
(s513 (/ 1.0 2.0))
(s514 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s517 (/ 1.0 2.0))
(s518 (/ 1.0 2.0))
(s519 (/ 1.0 2.0))
(s750 (/ 1.0 2.0))
(s751 (/ 1.0 2.0))
(s752 (/ 1.0 2.0))
(s753 (/ 1.0 2.0))
(s754 (/ 1.0 2.0))
(s755 (/ 1.0 2.0))
(s756 (/ 1.0 2.0))
(s757 (/ 1.0 2.0))
(s758 (/ 1.0 2.0))
(s761 (/ 1.0 2.0))
(s762 (/ 1.0 2.0))
(s763 (/ 1.0 2.0))
(s764 (/ 1.0 2.0))
(s765 (/ 1.0 2.0))
(s766 (/ 1.0 2.0))
(s767 (/ 1.0 2.0))
(s768 (/ 1.0 2.0))
(s770 (/ 1.0 2.0))
(s771 (/ 1.0 2.0))
(s772 (/ 1.0 2.0))
(s773 (/ 1.0 2.0))
(s774 (/ 1.0 2.0))
(s775 (/ 1.0 2.0))
(s776 (/ 1.0 2.0))
(s777 (/ 1.0 2.0))
(s778 (/ 1.0 2.0))
(s780 (/ 1.0 2.0))
(s781 (/ 1.0 2.0))
(s782 (/ 1.0 2.0))
(s783 (/ 1.0 2.0))
(s784 (/ 1.0 2.0))
(s785 (/ 1.0 2.0))
(s786 (/ 1.0 2.0))
(s787 (/ 1.0 2.0))
(s788 (/ 1.0 2.0))
(s790 (/ 1.0 2.0))
(s791 (/ 1.0 2.0))
(s792 (/ 1.0 2.0))
(s793 (/ 1.0 2.0))
(s794 (/ 1.0 2.0))
(s795 (/ 1.0 2.0))
(s796 (/ 1.0 2.0))
(s797 (/ 1.0 2.0))
(s798 (/ 1.0 2.0))
(s800 (/ 1.0 2.0))
(s801 (/ 1.0 2.0))
(s802 (/ 1.0 2.0))
(s803 (/ 1.0 2.0))
(s804 (/ 1.0 2.0))
(s805 (/ 1.0 2.0))
(s806 (/ 1.0 2.0))
(s807 (/ 1.0 2.0))
(s808 (/ 1.0 2.0))
(s810 (/ 1.0 2.0))
(s811 (/ 1.0 2.0))
(s812 (/ 1.0 2.0))
(s813 (/ 1.0 2.0))
(s814 (/ 1.0 2.0))
(s815 (/ 1.0 2.0))
(s816 (/ 1.0 2.0))
(s817 (/ 1.0 2.0))
(s818 (/ 1.0 2.0))
(s820 (/ 1.0 2.0))
(s821 (/ 1.0 2.0))
(s822 (/ 1.0 2.0))
(s823 (/ 1.0 2.0))
(s824 (/ 1.0 2.0))
(s825 (/ 1.0 2.0))
(s826 (/ 1.0 2.0))
(s827 (/ 1.0 2.0))
(s828 (/ 1.0 2.0))
(s830 (/ 1.0 2.0))
(s831 (/ 1.0 2.0))
(s832 (/ 1.0 2.0))
(s833 (/ 1.0 2.0))
(s834 (/ 1.0 2.0))
(s835 (/ 1.0 2.0))
(s836 (/ 1.0 2.0))
(s837 (/ 1.0 2.0))
(s838 (/ 1.0 2.0))
(s840 (/ 1.0 2.0))
(s841 (/ 1.0 2.0))
(s842 (/ 1.0 2.0))
(s843 (/ 1.0 2.0))
(s844 (/ 1.0 2.0))
(s845 (/ 1.0 2.0))
(s846 (/ 1.0 2.0))
(s847 (/ 1.0 2.0))
(s848 (/ 1.0 2.0))
(s870 (/ 1.0 2.0))
(s872 (/ 1.0 2.0))
(s873 (/ 1.0 2.0))
(s874 (/ 1.0 2.0))
(s875 (/ 1.0 2.0))
(s876 (/ 1.0 2.0))
(s877 (/ 1.0 2.0))
(s878 (/ 1.0 2.0))
(s879 (/ 1.0 2.0))
(s880 (/ 1.0 2.0))
(s881 (/ 1.0 2.0))
(s883 (/ 1.0 2.0))
(s884 (/ 1.0 2.0))
(s885 (/ 1.0 2.0))
(s886 (/ 1.0 2.0))
(s887 (/ 1.0 2.0))
(s888 (/ 1.0 2.0))
(s889 (/ 1.0 2.0))
(s890 (/ 1.0 2.0))
(s891 (/ 1.0 2.0))
(s892 (/ 1.0 2.0))
(s894 (/ 1.0 2.0))
(s895 (/ 1.0 2.0))
(s896 (/ 1.0 2.0))
(s897 (/ 1.0 2.0))
(s898 (/ 1.0 2.0))
(s899 (/ 1.0 2.0))
(s900 (/ 1.0 2.0))
(s901 (/ 1.0 2.0))
(s902 (/ 1.0 2.0))
(s903 (/ 1.0 2.0))
(s905 (/ 1.0 2.0))
(s906 (/ 1.0 2.0))
(s907 (/ 1.0 2.0))
(s908 (/ 1.0 2.0))
(s909 (/ 1.0 2.0))
(s910 (/ 1.0 2.0))
(s911 (/ 1.0 2.0))
(s912 (/ 1.0 2.0))
(s913 (/ 1.0 2.0))
(s914 (/ 1.0 2.0))
(s916 (/ 1.0 2.0))
(s917 (/ 1.0 2.0))
(s918 (/ 1.0 2.0))
(s919 (/ 1.0 2.0))
(s920 (/ 1.0 2.0))
(s921 (/ 1.0 2.0))
(s922 (/ 1.0 2.0))
(s923 (/ 1.0 2.0))
(s924 (/ 1.0 2.0))
(s925 (/ 1.0 2.0))
(s927 (/ 1.0 2.0))
(s928 (/ 1.0 2.0))
(s929 (/ 1.0 2.0))
(s930 (/ 1.0 2.0))
(s931 (/ 1.0 2.0))
(s932 (/ 1.0 2.0))
(s933 (/ 1.0 2.0))
(s934 (/ 1.0 2.0))
(s935 (/ 1.0 2.0))
(s936 (/ 1.0 2.0))
(s938 (/ 1.0 2.0))
(s939 (/ 1.0 2.0))
(s940 (/ 1.0 2.0))
(s941 (/ 1.0 2.0))
(s942 (/ 1.0 2.0))
(s943 (/ 1.0 2.0))
(s944 (/ 1.0 2.0))
(s945 (/ 1.0 2.0))
(s946 (/ 1.0 2.0))
(s947 (/ 1.0 2.0))
(s949 (/ 1.0 2.0))
(s950 (/ 1.0 2.0))
(s951 (/ 1.0 2.0))
(s952 (/ 1.0 2.0))
(s953 (/ 1.0 2.0))
(s954 (/ 1.0 2.0))
(s955 (/ 1.0 2.0))
(s956 (/ 1.0 2.0))
(s957 (/ 1.0 2.0))
(s958 (/ 1.0 2.0))
(s961 (/ 1.0 2.0))
(s962 (/ 1.0 2.0))
(s963 (/ 1.0 2.0))
(s964 (/ 1.0 2.0))
(s965 (/ 1.0 2.0))
(s966 (/ 1.0 2.0))
(s967 (/ 1.0 2.0))
(s968 (/ 1.0 2.0))
(s969 (/ 1.0 2.0))
(s970 (/ 1.0 2.0))
(s972 (/ 1.0 2.0))
(s973 (/ 1.0 2.0))
(s974 (/ 1.0 2.0))
(s975 (/ 1.0 2.0))
(s976 (/ 1.0 2.0))
(s977 (/ 1.0 2.0))
(s978 (/ 1.0 2.0))
(s979 (/ 1.0 2.0))
(s980 (/ 1.0 2.0))
(s981 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/3420 variables, and 363 constraints, problems are : Problem set: 0 solved, 363 unsolved in 5111 ms.
Refiners :[Domain max(s): 363/1090 constraints, Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 363 unsolved
SDD proceeding with computation,363 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,363 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,363 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,363 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,363 properties remain. new max is 64
SDD size :10 after 12
SDD proceeding with computation,363 properties remain. new max is 128
SDD size :12 after 14
SDD proceeding with computation,363 properties remain. new max is 256
SDD size :14 after 15
SDD proceeding with computation,363 properties remain. new max is 512
SDD size :15 after 77
SDD proceeding with computation,363 properties remain. new max is 1024
SDD size :77 after 155
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/3420 variables, and 363 constraints, problems are : Problem set: 0 solved, 363 unsolved in 5042 ms.
Refiners :[Domain max(s): 363/1090 constraints, Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 0/363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10805ms problems are : Problem set: 0 solved, 363 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 363 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Invariant property smplace_750 does not hold.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
SDD proceeding with computation,362 properties remain. new max is 1024
SDD size :155 after 280
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 20 place count 1080 transition count 4970
Deduced a syphon composed of 220 places in 7 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 460 place count 860 transition count 4970
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 550 place count 770 transition count 4070
Iterating global reduction 2 with 90 rules applied. Total rules applied 640 place count 770 transition count 4070
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 6 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 812 place count 684 transition count 3984
Applied a total of 812 rules in 1023 ms. Remains 684 /1090 variables (removed 406) and now considering 3984/5200 (removed 1216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036 ms. Remains : 684/1090 places, 3984/5200 transitions.
SDD proceeding with computation,362 properties remain. new max is 2048
SDD size :280 after 1325
SDD proceeding with computation,362 properties remain. new max is 4096
SDD size :1325 after 2284
Invariant property smplace_753 does not hold.
SDD proceeding with computation,361 properties remain. new max is 4096
SDD size :2284 after 6625
Invariant property smplace_791 does not hold.
Invariant property smplace_790 does not hold.
Invariant property smplace_763 does not hold.
SDD proceeding with computation,358 properties remain. new max is 4096
SDD size :6625 after 9290
RANDOM walk for 3340030 steps (8 resets) in 120005 ms. (27 steps per ms) remains 350/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 349/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 348/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 348/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 347/348 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 347/347 properties
SDD proceeding with computation,358 properties remain. new max is 8192
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 347/347 properties
SDD size :9290 after 47536
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 346/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 346/346 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 346/346 properties
SDD proceeding with computation,358 properties remain. new max is 16384
SDD size :47536 after 69970
Invariant property smplace_751 does not hold.
SDD proceeding with computation,357 properties remain. new max is 16384
SDD size :69970 after 141220
Invariant property smplace_792 does not hold.
Invariant property smplace_771 does not hold.
Invariant property smplace_770 does not hold.
Invariant property smplace_761 does not hold.
SDD proceeding with computation,353 properties remain. new max is 16384
SDD size :141220 after 210918
Invariant property smplace_773 does not hold.
SDD proceeding with computation,352 properties remain. new max is 16384
SDD size :210918 after 238528
Interrupted probabilistic random walk after 4575076 steps, run timeout after 111001 ms. (steps per millisecond=41 ) properties seen :320 out of 346
Probabilistic random walk after 4575076 steps, saw 2464472 distinct states, run finished after 111013 ms. (steps per millisecond=41 ) properties seen :320
[2026-05-24 01:09:57] [INFO ] Flow matrix only has 1114 transitions (discarded 2870 similar events)
// Phase 1: matrix 1114 rows 684 cols
[2026-05-24 01:09:57] [INFO ] Computed 31 invariants in 18 ms
[2026-05-24 01:09:57] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 566/589 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 18/607 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1003/1610 variables, 607/634 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1610 variables, 234/868 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1610 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 28/1638 variables, 10/878 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1638 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1638 variables, 106/985 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1638 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 26/1664 variables, 12/997 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1664 variables, 12/1009 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1664 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 53/1717 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1717 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 2/1719 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1719 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 79/1798 variables, 55/1067 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1798 variables, 84/1151 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1798 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (OVERLAPS) 0/1798 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1798/1798 variables, and 1151 constraints, problems are : Problem set: 0 solved, 23 unsolved in 12335 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 684/684 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 566/589 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 18/607 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:11] [INFO ] Deduced a trap composed of 3 places in 630 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:12] [INFO ] Deduced a trap composed of 3 places in 539 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:12] [INFO ] Deduced a trap composed of 3 places in 495 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:13] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:13] [INFO ] Deduced a trap composed of 3 places in 490 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:13] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:14] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:14] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:14] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:14] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:15] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:15] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:15] [INFO ] Deduced a trap composed of 13 places in 334 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:16] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:16] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:16] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:16] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:17] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:17] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:17] [INFO ] Deduced a trap composed of 21 places in 388 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:17] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:18] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:18] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:19] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:19] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:19] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:19] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:20] [INFO ] Deduced a trap composed of 19 places in 356 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:20] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:20] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:20] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:21] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:21] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:21] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:22] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:22] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:22] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1003/1610 variables, 607/671 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1610 variables, 234/905 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1610 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 28/1638 variables, 10/915 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1638 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1638 variables, 106/1022 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1638 variables, 14/1036 constraints. Problems are: Problem set: 0 solved, 23 unsolved
SDD proceeding with computation,352 properties remain. new max is 32768
SDD size :238528 after 1.02945e+06
At refinement iteration 15 (INCLUDED_ONLY) 0/1638 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 26/1664 variables, 12/1048 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1664 variables, 12/1060 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1664 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 53/1717 variables, 2/1062 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:44] [INFO ] Deduced a trap composed of 72 places in 717 ms of which 77 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1717 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:48] [INFO ] Deduced a trap composed of 72 places in 946 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:10:49] [INFO ] Deduced a trap composed of 77 places in 605 ms of which 47 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1717 variables, 2/1065 constraints. Problems are: Problem set: 0 solved, 23 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 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s35 1)
(s37 0)
(s38 0)
(s39 1)
(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 1)
(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 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)timeout
(s425 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1717/1798 variables, and 1065 constraints, problems are : Problem set: 0 solved, 23 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 629/684 constraints, ReadFeed: 352/436 constraints, PredecessorRefiner: 14/23 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57405ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 684/684 places, 3984/3984 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 684 transition count 3894
Deduced a syphon composed of 90 places in 23 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 594 transition count 3894
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 23 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 188 place count 590 transition count 3890
Applied a total of 188 rules in 646 ms. Remains 590 /684 variables (removed 94) and now considering 3890/3984 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 646 ms. Remains : 590/684 places, 3890/3984 transitions.
RANDOM walk for 4000000 steps (8 resets) in 39573 ms. (101 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 547 ms. (729 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 863 ms. (462 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 948 ms. (421 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 870 ms. (459 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 682 ms. (585 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 564 ms. (707 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 683 ms. (584 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 688 ms. (580 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 768 ms. (520 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 686 ms. (582 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 625 ms. (638 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 552 ms. (723 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 635 ms. (628 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 594 ms. (672 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 780 ms. (512 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 700 ms. (570 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 718 ms. (556 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 650 ms. (614 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 615 ms. (649 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 798 ms. (500 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 23/23 properties
SDD proceeding with computation,352 properties remain. new max is 65536
SDD size :1.02945e+06 after 1.5713e+06
Interrupted probabilistic random walk after 1531574 steps, run timeout after 45001 ms. (steps per millisecond=34 ) properties seen :0 out of 23
Probabilistic random walk after 1531574 steps, saw 911494 distinct states, run finished after 45001 ms. (steps per millisecond=34 ) properties seen :0
[2026-05-24 01:11:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:11:55] [INFO ] Computed 31 invariants in 7 ms
[2026-05-24 01:11:55] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 481/504 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 18/522 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 918/1440 variables, 522/549 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1440 variables, 234/783 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1440 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 28/1468 variables, 10/793 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1468 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1468 variables, 106/900 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 26/1494 variables, 12/912 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1494 variables, 12/924 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1494 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 44/1538 variables, 2/926 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1538 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 2/1540 variables, 1/927 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1540 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 70/1610 variables, 46/973 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 84/1057 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 23 unsolved in 12040 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 481/504 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 18/522 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:09] [INFO ] Deduced a trap composed of 3 places in 589 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:10] [INFO ] Deduced a trap composed of 3 places in 496 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:10] [INFO ] Deduced a trap composed of 3 places in 431 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:11] [INFO ] Deduced a trap composed of 3 places in 367 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:11] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:11] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:12] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:12] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:12] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:12] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:12] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:13] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:13] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:13] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:13] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:14] [INFO ] Deduced a trap composed of 13 places in 631 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:15] [INFO ] Deduced a trap composed of 15 places in 449 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:15] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:15] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:15] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:16] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:16] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:16] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:16] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:17] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:17] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:18] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:18] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:18] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:18] [INFO ] Deduced a trap composed of 19 places in 378 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:19] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:19] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:19] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:19] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:19] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:20] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:20] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 918/1440 variables, 522/586 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1440 variables, 234/820 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1440 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 28/1468 variables, 10/830 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 1/831 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1468 variables, 106/937 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1468 variables, 14/951 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1468 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 26/1494 variables, 12/963 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1494 variables, 12/975 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1494 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 44/1538 variables, 2/977 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:41] [INFO ] Deduced a trap composed of 72 places in 755 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:42] [INFO ] Deduced a trap composed of 72 places in 770 ms of which 52 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1538 variables, 2/979 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:46] [INFO ] Deduced a trap composed of 72 places in 814 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:47] [INFO ] Deduced a trap composed of 72 places in 750 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:48] [INFO ] Deduced a trap composed of 77 places in 671 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:49] [INFO ] Deduced a trap composed of 72 places in 735 ms of which 63 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1538 variables, 4/983 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:51] [INFO ] Deduced a trap composed of 72 places in 714 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:51] [INFO ] Deduced a trap composed of 95 places in 587 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:52] [INFO ] Deduced a trap composed of 72 places in 666 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:54] [INFO ] Deduced a trap composed of 91 places in 758 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:55] [INFO ] Deduced a trap composed of 72 places in 839 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:56] [INFO ] Deduced a trap composed of 72 places in 789 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:12:57] [INFO ] Deduced a trap composed of 72 places in 790 ms of which 71 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1538 variables, 7/990 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:00] [INFO ] Deduced a trap composed of 77 places in 802 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:01] [INFO ] Deduced a trap composed of 72 places in 767 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:02] [INFO ] Deduced a trap composed of 77 places in 796 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:03] [INFO ] Deduced a trap composed of 94 places in 714 ms of which 57 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1538 variables, 4/994 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:06] [INFO ] Deduced a trap composed of 72 places in 778 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:07] [INFO ] Deduced a trap composed of 72 places in 754 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:08] [INFO ] Deduced a trap composed of 77 places in 815 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:09] [INFO ] Deduced a trap composed of 77 places in 759 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,352 properties remain. new max is 131072
SDD size :1.5713e+06 after 2.51641e+06
[2026-05-24 01:13:10] [INFO ] Deduced a trap composed of 72 places in 828 ms of which 75 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1538 variables, 5/999 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1538 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (OVERLAPS) 2/1540 variables, 1/1000 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1540 variables, 9/1009 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:20] [INFO ] Deduced a trap composed of 37 places in 687 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:21] [INFO ] Deduced a trap composed of 77 places in 768 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:22] [INFO ] Deduced a trap composed of 77 places in 728 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:22] [INFO ] Deduced a trap composed of 77 places in 637 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:13:24] [INFO ] Deduced a trap composed of 77 places in 1214 ms of which 76 ms to minimize.
SMT process timed out in 88251ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 6 properties in 3061 ms.
Support contains 17 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 181 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 4000000 steps (8 resets) in 48216 ms. (82 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 833 ms. (479 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 844 ms. (473 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 870 ms. (459 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 767 ms. (520 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 794 ms. (503 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 794 ms. (503 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 935 ms. (427 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 755 ms. (529 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1032 ms. (387 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 847 ms. (471 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 894 ms. (446 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 785 ms. (508 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 768 ms. (520 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 788 ms. (506 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 768 ms. (520 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 842 ms. (474 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 770 ms. (518 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 1976557 steps, run timeout after 54001 ms. (steps per millisecond=36 ) properties seen :0 out of 17
Probabilistic random walk after 1976557 steps, saw 1152960 distinct states, run finished after 54001 ms. (steps per millisecond=36 ) properties seen :0
[2026-05-24 01:14:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:14:39] [INFO ] Invariant cache hit.
[2026-05-24 01:14:39] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 375/392 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 14/406 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 714/1120 variables, 406/427 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1120 variables, 140/567 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1120 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 64/1184 variables, 10/577 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1184 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 82/660 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1184 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 78/1262 variables, 36/696 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 30/726 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 132/1394 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1394 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 6/1400 variables, 3/735 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1400 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 210/1610 variables, 138/873 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 184/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 17 unsolved in 7488 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 375/392 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 14/406 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:48] [INFO ] Deduced a trap composed of 3 places in 442 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:49] [INFO ] Deduced a trap composed of 3 places in 393 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:49] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:49] [INFO ] Deduced a trap composed of 24 places in 347 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:50] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:50] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:50] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:50] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:51] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:51] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:51] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:51] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:52] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:52] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:52] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:52] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:53] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:53] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:53] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:53] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:53] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:53] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:54] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:54] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:54] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:55] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:55] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:55] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:14:55] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 714/1120 variables, 406/456 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 140/596 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 64/1184 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1184 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1184 variables, 82/689 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1184 variables, 13/702 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1184 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 78/1262 variables, 36/738 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1262 variables, 30/768 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 132/1394 variables, 6/774 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:05] [INFO ] Deduced a trap composed of 72 places in 678 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:06] [INFO ] Deduced a trap composed of 77 places in 687 ms of which 52 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1394 variables, 2/776 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:09] [INFO ] Deduced a trap composed of 78 places in 869 ms of which 78 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1394 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1394 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 6/1400 variables, 3/780 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1400 variables, 4/784 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:13] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:13] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:14] [INFO ] Deduced a trap composed of 39 places in 820 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:14] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:15] [INFO ] Deduced a trap composed of 37 places in 823 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:15] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:16] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:16] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:16] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:16] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 13 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1400 variables, 10/794 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:18] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:18] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:19] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:19] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:19] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:19] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:20] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:20] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:20] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:21] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:21] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:21] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 8 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1400 variables, 12/806 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:22] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 11 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1400 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:25] [INFO ] Deduced a trap composed of 72 places in 891 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:26] [INFO ] Deduced a trap composed of 77 places in 835 ms of which 78 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1400 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:27] [INFO ] Deduced a trap composed of 72 places in 871 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:28] [INFO ] Deduced a trap composed of 86 places in 641 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:15:29] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 18 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1400 variables, 3/812 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1400 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 210/1610 variables, 138/950 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1610 variables, 184/1134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1610 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (OVERLAPS) 0/1610 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1134 constraints, problems are : Problem set: 0 solved, 17 unsolved in 52093 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59622ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 3372 ms.
Support contains 17 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 179 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 173 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:15:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:15:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:15:44] [INFO ] Implicit Places using invariants in 1664 ms returned []
[2026-05-24 01:15:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:15:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:15:45] [INFO ] State equation strengthened by 436 read => feed constraints.
Invariant property smplace_793 does not hold.
Invariant property smplace_781 does not hold.
Invariant property smplace_780 does not hold.
Invariant property smplace_762 does not hold.
Invariant property smplace_752 does not hold.
[2026-05-24 01:15:52] [INFO ] Implicit Places using invariants and state equation in 7737 ms returned []
Implicit Place search using SMT with State Equation took 9416 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:15:52] [INFO ] Redundant transitions in 418 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:15:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:15:52] [INFO ] Invariant cache hit.
[2026-05-24 01:15:52] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,347 properties remain. new max is 131072
SDD size :2.51641e+06 after 3.82741e+06
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32743ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42818 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 400000 steps (8 resets) in 7175 ms. (55 steps per ms) remains 16/16 properties
Running SMT prover for 16 properties.
[2026-05-24 01:16:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:16:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:16:27] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2026-05-24 01:16:27] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2026-05-24 01:16:28] [INFO ] After 436ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2026-05-24 01:16:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:16:28] [INFO ] After 312ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2026-05-24 01:16:30] [INFO ] After 1911ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2026-05-24 01:16:30] [INFO ] After 2547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:16:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2026-05-24 01:16:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2026-05-24 01:16:30] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2026-05-24 01:16:31] [INFO ] After 430ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:31] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:32] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:32] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:32] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:33] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:33] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 14 ms to minimize.
[2026-05-24 01:16:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2107 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:33] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 4 ms to minimize.
[2026-05-24 01:16:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:34] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:34] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:34] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 3 ms to minimize.
[2026-05-24 01:16:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 722 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:34] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 4 ms to minimize.
[2026-05-24 01:16:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:35] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:35] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 3 ms to minimize.
[2026-05-24 01:16:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:35] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 5 ms to minimize.
[2026-05-24 01:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:36] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 9 ms to minimize.
[2026-05-24 01:16:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:36] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:36] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 5 ms to minimize.
[2026-05-24 01:16:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:37] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 11 ms to minimize.
[2026-05-24 01:16:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:38] [INFO ] Deduced a trap composed of 13 places in 613 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:38] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 6 ms to minimize.
[2026-05-24 01:16:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 965 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:39] [INFO ] Deduced a trap composed of 19 places in 717 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:39] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 6 ms to minimize.
[2026-05-24 01:16:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1070 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:43] [INFO ] Deduced a trap composed of 86 places in 788 ms of which 79 ms to minimize.
[2026-05-24 01:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 914 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:43] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 12 ms to minimize.
[2026-05-24 01:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:44] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 9 ms to minimize.
[2026-05-24 01:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:46] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 6 ms to minimize.
[2026-05-24 01:16:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:48] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 6 ms to minimize.
[2026-05-24 01:16:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
TRAPS : Iteration 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:49] [INFO ] Deduced a trap composed of 52 places in 756 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:50] [INFO ] Deduced a trap composed of 69 places in 662 ms of which 40 ms to minimize.
[2026-05-24 01:16:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1614 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:51] [INFO ] Deduced a trap composed of 72 places in 761 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:52] [INFO ] Deduced a trap composed of 86 places in 656 ms of which 47 ms to minimize.
[2026-05-24 01:16:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1616 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:52] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 13 ms to minimize.
[2026-05-24 01:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:53] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 11 ms to minimize.
[2026-05-24 01:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
TRAPS : Iteration 6
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:16:54] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 13 ms to minimize.
[2026-05-24 01:16:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
TRAPS : Iteration 7
[2026-05-24 01:16:57] [INFO ] After 26883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2026-05-24 01:16:58] [INFO ] After 27889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 4000000 steps (8 resets) in 35210 ms. (113 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 576 ms. (693 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 608 ms. (656 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 599 ms. (666 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 543 ms. (735 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 681 ms. (586 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 708 ms. (564 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 753 ms. (530 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 664 ms. (601 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 564 ms. (707 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 629 ms. (634 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 556 ms. (718 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 680 ms. (587 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 539 ms. (740 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 576 ms. (693 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 611 ms. (653 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 16/16 properties
Detected timeout of ITS tools.
[2026-05-24 01:17:18] [INFO ] Flatten gal took : 190 ms
[2026-05-24 01:17:18] [INFO ] Applying decomposition
[2026-05-24 01:17:18] [INFO ] Flatten gal took : 194 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6702186552113060033.txt' '-o' '/tmp/graph6702186552113060033.bin' '-w' '/tmp/graph6702186552113060033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6702186552113060033.bin' '-l' '-1' '-v' '-w' '/tmp/graph6702186552113060033.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:17:19] [INFO ] Decomposing Gal with order
[2026-05-24 01:17:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:17:20] [INFO ] Removed a total of 10854 redundant transitions.
[2026-05-24 01:17:21] [INFO ] Flatten gal took : 1230 ms
[2026-05-24 01:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 331 labels/synchronizations in 506 ms.
[2026-05-24 01:17:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2221864604231286222.gal : 86 ms
[2026-05-24 01:17:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13708670073530643342.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2221864604231286222.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13708670073530643342.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13708670073530643342.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :2 after 6480
Interrupted probabilistic random walk after 1308791 steps, run timeout after 39001 ms. (steps per millisecond=33 ) properties seen :0 out of 16
Probabilistic random walk after 1308791 steps, saw 791526 distinct states, run finished after 39001 ms. (steps per millisecond=33 ) properties seen :0
[2026-05-24 01:17:50] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:17:50] [INFO ] Invariant cache hit.
[2026-05-24 01:17:50] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 376/392 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 14/406 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 714/1120 variables, 406/427 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1120 variables, 140/567 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1120 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 64/1184 variables, 10/577 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1184 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 82/660 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1184 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 78/1262 variables, 36/696 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 30/726 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :6480 after 294255
At refinement iteration 15 (OVERLAPS) 132/1394 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :294255 after 579403
At refinement iteration 16 (INCLUDED_ONLY) 0/1394 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 6/1400 variables, 3/735 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1400 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 210/1610 variables, 138/873 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 184/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :579403 after 1.69665e+06
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 16 unsolved in 7631 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 376/392 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 14/406 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:17:59] [INFO ] Deduced a trap composed of 3 places in 428 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:17:59] [INFO ] Deduced a trap composed of 11 places in 562 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:00] [INFO ] Deduced a trap composed of 15 places in 507 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:00] [INFO ] Deduced a trap composed of 17 places in 365 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:01] [INFO ] Deduced a trap composed of 3 places in 374 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:01] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:01] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:01] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:02] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :1.69665e+06 after 3.73261e+06
[2026-05-24 01:18:02] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:02] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:02] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:03] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:03] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:03] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:03] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:03] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:03] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:04] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:04] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:04] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:04] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:05] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:05] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:05] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:05] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:06] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:06] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 714/1120 variables, 406/455 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1120 variables, 140/595 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 64/1184 variables, 10/605 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1184 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1184 variables, 82/688 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1184 variables, 13/701 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1184 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 78/1262 variables, 36/737 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1262 variables, 30/767 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1262 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 132/1394 variables, 6/773 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:16] [INFO ] Deduced a trap composed of 72 places in 881 ms of which 71 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1394 variables, 1/774 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1394 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 6/1400 variables, 3/777 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1400 variables, 3/780 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:20] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:20] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:20] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:20] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:21] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:21] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:22] [INFO ] Deduced a trap composed of 27 places in 838 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:23] [INFO ] Deduced a trap composed of 77 places in 751 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:23] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:24] [INFO ] Deduced a trap composed of 58 places in 835 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:24] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:25] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 12 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1400 variables, 12/792 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:26] [INFO ] Deduced a trap composed of 72 places in 737 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:27] [INFO ] Deduced a trap composed of 37 places in 726 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:28] [INFO ] Deduced a trap composed of 25 places in 721 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:28] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:29] [INFO ] Deduced a trap composed of 27 places in 798 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:29] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:30] [INFO ] Deduced a trap composed of 29 places in 720 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:30] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:31] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:31] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:32] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:32] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:33] [INFO ] Deduced a trap composed of 35 places in 726 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:18:33] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 8 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1400 variables, 14/806 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1400 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 26 (OVERLAPS) 210/1610 variables, 138/944 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1610 variables, 184/1128 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1610 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (OVERLAPS) 0/1610 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1128 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45500 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53155ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 3156 ms.
Support contains 16 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 178 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 174 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:18:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:18:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:18:48] [INFO ] Implicit Places using invariants in 1436 ms returned []
[2026-05-24 01:18:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:18:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:18:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:18:55] [INFO ] Implicit Places using invariants and state equation in 6882 ms returned []
Implicit Place search using SMT with State Equation took 8321 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:18:55] [INFO ] Redundant transitions in 412 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:18:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:18:55] [INFO ] Invariant cache hit.
[2026-05-24 01:18:55] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)timeout
(s410 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32093ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41042 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 400000 steps (8 resets) in 3828 ms. (104 steps per ms) remains 16/16 properties
Running SMT prover for 16 properties.
[2026-05-24 01:19:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:19:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:19:29] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2026-05-24 01:19:29] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2026-05-24 01:19:29] [INFO ] After 393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2026-05-24 01:19:29] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:19:30] [INFO ] After 259ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2026-05-24 01:19:32] [INFO ] After 2265ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2026-05-24 01:19:32] [INFO ] After 2826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:19:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 29 ms returned sat
[2026-05-24 01:19:32] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 12 ms returned sat
[2026-05-24 01:19:33] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2026-05-24 01:19:33] [INFO ] After 559ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:34] [INFO ] Deduced a trap composed of 3 places in 414 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:34] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:34] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:34] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:35] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:35] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 20 ms to minimize.
[2026-05-24 01:19:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1985 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:35] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 6 ms to minimize.
[2026-05-24 01:19:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:36] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:36] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:36] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 5 ms to minimize.
[2026-05-24 01:19:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 837 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:37] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 5 ms to minimize.
[2026-05-24 01:19:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:37] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:37] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 5 ms to minimize.
[2026-05-24 01:19:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:38] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 7 ms to minimize.
[2026-05-24 01:19:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:38] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 15 ms to minimize.
[2026-05-24 01:19:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:39] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:39] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 8 ms to minimize.
[2026-05-24 01:19:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:40] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 17 ms to minimize.
[2026-05-24 01:19:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:41] [INFO ] Deduced a trap composed of 13 places in 762 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:42] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 5 ms to minimize.
[2026-05-24 01:19:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1065 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:42] [INFO ] Deduced a trap composed of 19 places in 727 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:43] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 6 ms to minimize.
[2026-05-24 01:19:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1004 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:47] [INFO ] Deduced a trap composed of 86 places in 961 ms of which 122 ms to minimize.
[2026-05-24 01:19:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1111 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:47] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 18 ms to minimize.
[2026-05-24 01:19:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:49] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 14 ms to minimize.
[2026-05-24 01:19:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:51] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 9 ms to minimize.
[2026-05-24 01:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:53] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 8 ms to minimize.
[2026-05-24 01:19:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
TRAPS : Iteration 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:55] [INFO ] Deduced a trap composed of 52 places in 805 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:55] [INFO ] Deduced a trap composed of 69 places in 720 ms of which 60 ms to minimize.
[2026-05-24 01:19:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1740 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:57] [INFO ] Deduced a trap composed of 72 places in 946 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:57] [INFO ] Deduced a trap composed of 86 places in 762 ms of which 43 ms to minimize.
[2026-05-24 01:19:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1926 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:58] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 12 ms to minimize.
[2026-05-24 01:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :3.73261e+06 after 6.02224e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:19:59] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 17 ms to minimize.
[2026-05-24 01:19:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
TRAPS : Iteration 6
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:01] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 19 ms to minimize.
[2026-05-24 01:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
TRAPS : Iteration 7
[2026-05-24 01:20:04] [INFO ] After 31902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2026-05-24 01:20:05] [INFO ] After 33161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 249612 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 249612 steps, saw 171198 distinct states, run finished after 3005 ms. (steps per millisecond=83 ) properties seen :0
[2026-05-24 01:20:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:20:08] [INFO ] Invariant cache hit.
[2026-05-24 01:20:08] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:10] [INFO ] Deduced a trap composed of 3 places in 998 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:11] [INFO ] Deduced a trap composed of 3 places in 843 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:12] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:12] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:12] [INFO ] Deduced a trap composed of 15 places in 361 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:13] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 21 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:14] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:14] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1066 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5868ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 273 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 249656 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 249656 steps, saw 171227 distinct states, run finished after 3004 ms. (steps per millisecond=83 ) properties seen :0
[2026-05-24 01:20:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:20:17] [INFO ] Invariant cache hit.
[2026-05-24 01:20:17] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:19] [INFO ] Deduced a trap composed of 3 places in 977 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:20] [INFO ] Deduced a trap composed of 3 places in 883 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:21] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:21] [INFO ] Deduced a trap composed of 3 places in 346 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:21] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:22] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 20 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:23] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:23] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 2/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1066 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5443 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6102ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 14 ms.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 257477 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 257477 steps, saw 175725 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2026-05-24 01:20:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:20:27] [INFO ] Invariant cache hit.
[2026-05-24 01:20:27] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:29] [INFO ] Deduced a trap composed of 3 places in 566 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:29] [INFO ] Deduced a trap composed of 3 places in 449 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:30] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:30] [INFO ] Deduced a trap composed of 3 places in 918 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:31] [INFO ] Deduced a trap composed of 3 places in 775 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:32] [INFO ] Deduced a trap composed of 3 places in 691 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:32] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 36 ms to minimize.
SMT process timed out in 5935ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 264 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266728 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266728 steps, saw 181410 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2026-05-24 01:20:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:20:36] [INFO ] Invariant cache hit.
[2026-05-24 01:20:36] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:38] [INFO ] Deduced a trap composed of 3 places in 539 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:38] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:39] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:40] [INFO ] Deduced a trap composed of 3 places in 907 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:41] [INFO ] Deduced a trap composed of 3 places in 790 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:41] [INFO ] Deduced a trap composed of 3 places in 743 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:42] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:42] [INFO ] Deduced a trap composed of 19 places in 549 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:43] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:20:43] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 9 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7086 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 263 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 256 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:20:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:20:46] [INFO ] Implicit Places using invariants in 1793 ms returned []
[2026-05-24 01:20:46] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:20:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:20:54] [INFO ] Implicit Places using invariants and state equation in 7414 ms returned []
Implicit Place search using SMT with State Equation took 9215 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:20:54] [INFO ] Redundant transitions in 196 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:20:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:20:54] [INFO ] Invariant cache hit.
[2026-05-24 01:20:54] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 31785ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 31796ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41489 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 5 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 100 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2026-05-24 01:21:26] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:21:26] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:21:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2026-05-24 01:21:26] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:21:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:21:26] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:21:26] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:21:26] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 277 ms.
RANDOM walk for 40000 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 284911 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 284911 steps, saw 192906 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2026-05-24 01:21:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:21:29] [INFO ] Computed 31 invariants in 12 ms
[2026-05-24 01:21:29] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:21:30] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 388/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:21:31] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 7 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2134ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 190 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 281138 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 281138 steps, saw 190770 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2026-05-24 01:21:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:21:35] [INFO ] Invariant cache hit.
[2026-05-24 01:21:35] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:21:36] [INFO ] Deduced a trap composed of 58 places in 627 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:21:37] [INFO ] Deduced a trap composed of 72 places in 627 ms of which 49 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 388/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:21:38] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:21:38] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 2/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2654 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3365ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 134 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 260 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 197 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:21:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:21:40] [INFO ] Implicit Places using invariants in 1766 ms returned []
[2026-05-24 01:21:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:21:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:21:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:21:48] [INFO ] Implicit Places using invariants and state equation in 7480 ms returned []
Implicit Place search using SMT with State Equation took 9252 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:21:48] [INFO ] Redundant transitions in 192 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:21:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:21:48] [INFO ] Invariant cache hit.
[2026-05-24 01:21:48] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32229ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41898 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 2 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 68 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:22:20] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:22:20] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:22:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2026-05-24 01:22:20] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:22:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:22:21] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:22:21] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:22:21] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 250 ms.
RANDOM walk for 40000 steps (8 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274340 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274340 steps, saw 186246 distinct states, run finished after 3004 ms. (steps per millisecond=91 ) properties seen :0
[2026-05-24 01:22:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:22:24] [INFO ] Computed 31 invariants in 11 ms
[2026-05-24 01:22:24] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:22:25] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:22:26] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:22:26] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 3/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1401 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 270 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Invariant property smplace_784 does not hold.
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :6.02224e+07 after 1.91501e+08
Interrupted probabilistic random walk after 243925 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 243925 steps, saw 167740 distinct states, run finished after 3007 ms. (steps per millisecond=81 ) properties seen :0
[2026-05-24 01:22:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:22:30] [INFO ] Invariant cache hit.
[2026-05-24 01:22:30] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:22:31] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2007ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 174 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 165 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:22:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:22:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:22:33] [INFO ] Implicit Places using invariants in 1477 ms returned []
[2026-05-24 01:22:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:22:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:22:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:22:41] [INFO ] Implicit Places using invariants and state equation in 7760 ms returned []
Implicit Place search using SMT with State Equation took 9239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:22:41] [INFO ] Redundant transitions in 189 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:22:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:22:41] [INFO ] Invariant cache hit.
[2026-05-24 01:22:41] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 31954ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 31966ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41575 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 52 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:23:13] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:23:14] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:23:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 166 ms returned sat
[2026-05-24 01:23:14] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:23:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:23:14] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:23:14] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:23:14] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 654 ms.
RANDOM walk for 40000 steps (8 resets) in 310 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 259490 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 259490 steps, saw 176697 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2026-05-24 01:23:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:23:17] [INFO ] Computed 31 invariants in 8 ms
[2026-05-24 01:23:17] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:23:18] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:23:19] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2177ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 137 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 202 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256531 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256531 steps, saw 175199 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2026-05-24 01:23:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:23:23] [INFO ] Invariant cache hit.
[2026-05-24 01:23:23] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:23:24] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2146ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 166 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 164 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:23:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:23:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:23:27] [INFO ] Implicit Places using invariants in 1599 ms returned []
[2026-05-24 01:23:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:23:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:23:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:23:35] [INFO ] Implicit Places using invariants and state equation in 8073 ms returned []
Implicit Place search using SMT with State Equation took 9675 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:23:35] [INFO ] Redundant transitions in 208 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:23:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:23:35] [INFO ] Invariant cache hit.
[2026-05-24 01:23:35] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32033ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42114 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 67 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:24:08] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:24:08] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:24:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2026-05-24 01:24:08] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:24:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:24:08] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:24:08] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:24:08] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 311 ms.
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 265089 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 265089 steps, saw 180292 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2026-05-24 01:24:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:24:11] [INFO ] Computed 31 invariants in 4 ms
[2026-05-24 01:24:11] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:24:12] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:24:13] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:24:13] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 10 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1690 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2438ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 164 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 262856 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262856 steps, saw 178723 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2026-05-24 01:24:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:24:17] [INFO ] Invariant cache hit.
[2026-05-24 01:24:17] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:24:18] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:24:18] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2059ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 165 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 170 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:24:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:24:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:24:21] [INFO ] Implicit Places using invariants in 1665 ms returned []
[2026-05-24 01:24:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:24:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:24:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:24:28] [INFO ] Implicit Places using invariants and state equation in 7550 ms returned []
Implicit Place search using SMT with State Equation took 9217 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:24:29] [INFO ] Redundant transitions in 209 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:24:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:24:29] [INFO ] Invariant cache hit.
[2026-05-24 01:24:29] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 31890ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 31901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41512 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 47 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:25:01] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:25:01] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:25:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2026-05-24 01:25:01] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:25:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:25:01] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:25:01] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:25:01] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 239 ms.
RANDOM walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 270072 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 270072 steps, saw 183637 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2026-05-24 01:25:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:25:04] [INFO ] Computed 31 invariants in 7 ms
[2026-05-24 01:25:04] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 142 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 161 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271139 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271139 steps, saw 184250 distinct states, run finished after 3005 ms. (steps per millisecond=90 ) properties seen :0
[2026-05-24 01:25:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:25:09] [INFO ] Invariant cache hit.
[2026-05-24 01:25:09] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:25:10] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:25:11] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:25:11] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1539 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2245ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 160 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 162 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:25:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:25:13] [INFO ] Implicit Places using invariants in 1478 ms returned []
[2026-05-24 01:25:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:25:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:25:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:25:21] [INFO ] Implicit Places using invariants and state equation in 7775 ms returned []
Implicit Place search using SMT with State Equation took 9256 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:25:21] [INFO ] Redundant transitions in 199 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:25:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:25:21] [INFO ] Invariant cache hit.
[2026-05-24 01:25:21] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 31900ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 31911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41544 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 44 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:25:53] [INFO ] Computed 21 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:25:53] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:25:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2026-05-24 01:25:53] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:25:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:25:53] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:25:53] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
[2026-05-24 01:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2026-05-24 01:25:53] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:25:53] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 315 ms.
RANDOM walk for 40000 steps (8 resets) in 325 ms. (122 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245718 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245718 steps, saw 168873 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2026-05-24 01:25:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:25:56] [INFO ] Computed 31 invariants in 4 ms
[2026-05-24 01:25:56] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:25:57] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:25:58] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 440 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271865 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271865 steps, saw 184639 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2026-05-24 01:26:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:26:02] [INFO ] Invariant cache hit.
[2026-05-24 01:26:02] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1302 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:26:04] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:26:04] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 9 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:26:05] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2875ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 116 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 173 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 163 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:26:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:26:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:26:07] [INFO ] Implicit Places using invariants in 1875 ms returned []
[2026-05-24 01:26:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:26:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:26:08] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:26:16] [INFO ] Implicit Places using invariants and state equation in 8408 ms returned []
Implicit Place search using SMT with State Equation took 10287 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:26:16] [INFO ] Redundant transitions in 194 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:26:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:26:16] [INFO ] Invariant cache hit.
[2026-05-24 01:26:16] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32058ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32069ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42747 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 4 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 44 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:26:48] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:26:48] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:26:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2026-05-24 01:26:48] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:26:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:26:48] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:26:48] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:26:48] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 236 ms.
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266651 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266651 steps, saw 181342 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2026-05-24 01:26:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:26:52] [INFO ] Computed 31 invariants in 3 ms
[2026-05-24 01:26:52] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1711ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 163 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 275198 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 275198 steps, saw 186836 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2026-05-24 01:26:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:26:57] [INFO ] Invariant cache hit.
[2026-05-24 01:26:57] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:26:58] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1868ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 158 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 159 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:26:59] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:26:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:27:01] [INFO ] Implicit Places using invariants in 1983 ms returned []
[2026-05-24 01:27:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:27:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:27:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:27:09] [INFO ] Implicit Places using invariants and state equation in 8180 ms returned []
Implicit Place search using SMT with State Equation took 10169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:27:09] [INFO ] Redundant transitions in 295 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:27:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:27:09] [INFO ] Invariant cache hit.
[2026-05-24 01:27:09] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32566ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32580ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43230 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 39 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:27:42] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:27:42] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:27:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2026-05-24 01:27:42] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:27:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:27:42] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:27:42] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:27:42] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 235 ms.
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271491 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271491 steps, saw 184379 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2026-05-24 01:27:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:27:45] [INFO ] Computed 31 invariants in 3 ms
[2026-05-24 01:27:45] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:27:47] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:27:47] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1494 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 190 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 258126 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 258126 steps, saw 176012 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2026-05-24 01:27:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:27:51] [INFO ] Invariant cache hit.
[2026-05-24 01:27:51] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:27:52] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:27:53] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1676 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2515ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 243 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:27:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:27:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:27:56] [INFO ] Implicit Places using invariants in 1747 ms returned []
[2026-05-24 01:27:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:27:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:27:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:28:04] [INFO ] Implicit Places using invariants and state equation in 7947 ms returned []
Implicit Place search using SMT with State Equation took 9698 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:28:04] [INFO ] Redundant transitions in 209 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:28:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:28:04] [INFO ] Invariant cache hit.
[2026-05-24 01:28:04] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 31856ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 31866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42031 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 32 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:28:36] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:28:36] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:28:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2026-05-24 01:28:36] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:28:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:28:36] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:28:36] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:28:36] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 223 ms.
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 276859 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 276859 steps, saw 188025 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2026-05-24 01:28:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:28:39] [INFO ] Computed 31 invariants in 3 ms
[2026-05-24 01:28:39] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 709 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:28:40] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 10 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:28:41] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2104ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 161 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266046 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266046 steps, saw 180923 distinct states, run finished after 3004 ms. (steps per millisecond=88 ) properties seen :0
[2026-05-24 01:28:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:28:45] [INFO ] Invariant cache hit.
[2026-05-24 01:28:45] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:28:46] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1904ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 163 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 164 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:28:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:28:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:28:49] [INFO ] Implicit Places using invariants in 1734 ms returned []
[2026-05-24 01:28:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:28:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:28:56] [INFO ] Implicit Places using invariants and state equation in 7825 ms returned []
Implicit Place search using SMT with State Equation took 9565 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:28:57] [INFO ] Redundant transitions in 207 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:28:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:28:57] [INFO ] Invariant cache hit.
[2026-05-24 01:28:57] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 31865ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 31875ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41828 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 44 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:29:29] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:29:29] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:29:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2026-05-24 01:29:29] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:29:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:29:29] [INFO ] After 14ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:29:29] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:29:29] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 270600 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 270600 steps, saw 183965 distinct states, run finished after 3005 ms. (steps per millisecond=90 ) properties seen :0
[2026-05-24 01:29:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:29:32] [INFO ] Computed 31 invariants in 3 ms
[2026-05-24 01:29:32] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:29:34] [INFO ] Deduced a trap composed of 23 places in 1054 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:29:35] [INFO ] Deduced a trap composed of 72 places in 977 ms of which 120 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3520 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4372ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 271 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266574 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266574 steps, saw 181299 distinct states, run finished after 3004 ms. (steps per millisecond=88 ) properties seen :0
[2026-05-24 01:29:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:29:40] [INFO ] Invariant cache hit.
[2026-05-24 01:29:40] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 823 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:29:42] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 1/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1738 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2572ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 134 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 261 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 261 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:29:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:29:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:29:45] [INFO ] Implicit Places using invariants in 2226 ms returned []
[2026-05-24 01:29:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:29:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:29:46] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:29:54] [INFO ] Implicit Places using invariants and state equation in 8190 ms returned []
Implicit Place search using SMT with State Equation took 10417 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:29:54] [INFO ] Redundant transitions in 289 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:29:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:29:54] [INFO ] Invariant cache hit.
[2026-05-24 01:29:54] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32142ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32156ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43144 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 56 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:30:26] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:30:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:30:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-24 01:30:26] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:30:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:30:26] [INFO ] After 15ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:30:26] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:30:26] [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 339 ms.
RANDOM walk for 40000 steps (8 resets) in 436 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 248028 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 248028 steps, saw 170411 distinct states, run finished after 3004 ms. (steps per millisecond=82 ) properties seen :0
[2026-05-24 01:30:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:30:29] [INFO ] Computed 31 invariants in 2 ms
[2026-05-24 01:30:30] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:30:31] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 10 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 256 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 244178 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 244178 steps, saw 167877 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
[2026-05-24 01:30:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:30:36] [INFO ] Invariant cache hit.
[2026-05-24 01:30:36] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:30:38] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 1/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1643 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2536ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 256 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 279 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:30:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:30:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:30:41] [INFO ] Implicit Places using invariants in 1845 ms returned []
[2026-05-24 01:30:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:30:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:30:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:30:48] [INFO ] Implicit Places using invariants and state equation in 7818 ms returned []
Implicit Place search using SMT with State Equation took 9665 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:30:49] [INFO ] Redundant transitions in 199 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:30:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:30:49] [INFO ] Invariant cache hit.
[2026-05-24 01:30:49] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33080ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33089ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43257 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 58 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:31:22] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:31:22] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:31:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-24 01:31:22] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:31:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:31:22] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:31:22] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:31:22] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 331 ms.
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 230076 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 230076 steps, saw 158283 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2026-05-24 01:31:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:31:25] [INFO ] Computed 31 invariants in 3 ms
[2026-05-24 01:31:25] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1900ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 237369 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 237369 steps, saw 163372 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2026-05-24 01:31:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:31:30] [INFO ] Invariant cache hit.
[2026-05-24 01:31:30] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:31:33] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:31:33] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:31:33] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 3/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2596 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3591ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 263 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 378 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 237512 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 237512 steps, saw 163441 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
[2026-05-24 01:31:37] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:31:37] [INFO ] Invariant cache hit.
[2026-05-24 01:31:37] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:31:40] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:31:40] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:31:40] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 3/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2567 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3364ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 288 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 223 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:31:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:31:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:31:43] [INFO ] Implicit Places using invariants in 1589 ms returned []
[2026-05-24 01:31:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:31:44] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:31:52] [INFO ] Implicit Places using invariants and state equation in 9328 ms returned []
Implicit Place search using SMT with State Equation took 10919 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:31:52] [INFO ] Redundant transitions in 201 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:31:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:31:52] [INFO ] Invariant cache hit.
[2026-05-24 01:31:52] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32386ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43754 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 42 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:32:25] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:32:25] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:32:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2026-05-24 01:32:25] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:32:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:32:25] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:32:25] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:32:25] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 257 ms.
RANDOM walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 252560 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 252560 steps, saw 173049 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2026-05-24 01:32:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-24 01:32:28] [INFO ] Computed 31 invariants in 4 ms
[2026-05-24 01:32:28] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:32:30] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 11 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:32:31] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2621ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 247676 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 247676 steps, saw 170149 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2026-05-24 01:32:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:32:34] [INFO ] Invariant cache hit.
[2026-05-24 01:32:34] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:32:36] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 01:32:36] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2199ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 181 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 190 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-24 01:32:37] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:32:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:32:39] [INFO ] Implicit Places using invariants in 1920 ms returned []
[2026-05-24 01:32:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 01:32:39] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-24 01:32:47] [INFO ] Implicit Places using invariants and state equation in 7897 ms returned []
Implicit Place search using SMT with State Equation took 9828 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 01:32:47] [INFO ] Redundant transitions in 301 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-24 01:32:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-24 01:32:47] [INFO ] Invariant cache hit.
[2026-05-24 01:32:47] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32767ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32776ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43110 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 50 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-24 01:33:20] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:33:20] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:33:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2026-05-24 01:33:20] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 01:33:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:33:20] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 01:33:20] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 01:33:20] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 294 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3614 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 330 rules applied. Total rules applied 619 place count 186 transition count 446
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 707 place count 186 transition count 358
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 727 place count 176 transition count 358
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 737 place count 176 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 748 place count 176 transition count 337
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 839 place count 176 transition count 246
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 930 place count 85 transition count 246
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 940 place count 85 transition count 246
Applied a total of 940 rules in 48 ms. Remains 85 /590 variables (removed 505) and now considering 246/3890 (removed 3644) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 246 rows 85 cols
[2026-05-24 01:33:20] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:33:20] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 01:33:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2026-05-24 01:33:21] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2026-05-24 01:33:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-24 01:33:21] [INFO ] After 138ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :15
TRAPS : Iteration 0
[2026-05-24 01:33:21] [INFO ] After 447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
[2026-05-24 01:33:21] [INFO ] After 970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
[2026-05-24 01:33:21] [INFO ] Flatten gal took : 125 ms
[2026-05-24 01:33:22] [INFO ] Flatten gal took : 114 ms
[2026-05-24 01:33:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10424949619437403943.gal : 23 ms
[2026-05-24 01:33:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1388210330616748912.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10424949619437403943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1388210330616748912.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1388210330616748912.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 16
Invariant property smplace_979 does not hold.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :16 after 60
Invariant property smplace_980 does not hold.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :60 after 150
Invariant property smplace_991 does not hold.
Invariant property smplace_990 does not hold.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :150 after 300
Invariant property smplace_1002 does not hold.
Invariant property smplace_1001 does not hold.
Invariant property smplace_1000 does not hold.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :300 after 2100
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2100 after 2988
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :2988 after 3084
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :3084 after 3676
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :3676 after 4330
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :4330 after 5156
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :5156 after 10584
Invariant property smplace_1035 does not hold.
Invariant property smplace_1034 does not hold.
Invariant property smplace_1024 does not hold.
Invariant property smplace_1023 does not hold.
Invariant property smplace_1013 does not hold.
Invariant property smplace_1012 does not hold.
Invariant property smplace_1010 does not hold.
Invariant property smplace_795 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8.89056e+07,0.105377,6532,2,483,31,7168,6,0,589,4317,0
Total reachable state count : 88905600
Verifying 15 reachability properties.
Invariant property smplace_795 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_795,2016,0.106412,6660,2,308,31,7168,7,0,592,4317,0
Invariant property smplace_979 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_979,12,0.106725,6660,2,101,31,7168,8,0,594,4317,0
Invariant property smplace_980 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_980,8,0.107026,6660,2,90,31,7168,9,0,596,4317,0
Invariant property smplace_990 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_990,18,0.107305,6660,2,121,31,7168,10,0,598,4317,0
Invariant property smplace_991 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_991,18,0.107586,6660,2,121,31,7168,11,0,600,4317,0
Invariant property smplace_1000 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1000,72,0.107874,6660,2,156,31,7168,12,0,602,4317,0
Invariant property smplace_1001 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1001,72,0.108179,6660,2,156,31,7168,13,0,604,4317,0
Invariant property smplace_1002 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1002,144,0.108516,6660,2,179,31,7168,14,0,606,4317,0
Invariant property smplace_1010 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1010,8064,0.108852,6660,2,312,31,7168,15,0,608,4317,0
Invariant property smplace_1012 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1012,8064,0.109178,6660,2,312,31,7168,16,0,610,4317,0
Invariant property smplace_1013 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1013,8064,0.109502,6660,2,312,31,7168,17,0,612,4317,0
Invariant property smplace_1023 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1023,108864,0.109853,6660,2,343,31,7168,18,0,614,4317,0
Invariant property smplace_1024 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1024,127008,0.110185,6660,2,345,31,7168,19,0,616,4317,0
Invariant property smplace_1034 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1034,1.8144e+06,0.110509,6660,2,365,31,7168,20,0,618,4317,0
Invariant property smplace_1035 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1035,2.7216e+06,0.110827,6660,2,367,31,7168,21,0,620,4317,0
Over-approximation ignoring read arcs solved 0 properties in 1532 ms.
[2026-05-24 01:33:22] [INFO ] Flatten gal took : 347 ms
[2026-05-24 01:33:22] [INFO ] Flatten gal took : 213 ms
[2026-05-24 01:33:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4169787419753542768.gal : 27 ms
[2026-05-24 01:33:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability150044402361463841.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4169787419753542768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability150044402361463841.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityFireability150044402361463841.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :9 after 25
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :25 after 33
Detected timeout of ITS tools.
[2026-05-24 01:33:26] [INFO ] Flatten gal took : 136 ms
[2026-05-24 01:33:26] [INFO ] Applying decomposition
[2026-05-24 01:33:26] [INFO ] Flatten gal took : 135 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1544103269488263551.txt' '-o' '/tmp/graph1544103269488263551.bin' '-w' '/tmp/graph1544103269488263551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1544103269488263551.bin' '-l' '-1' '-v' '-w' '/tmp/graph1544103269488263551.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:33:26] [INFO ] Decomposing Gal with order
[2026-05-24 01:33:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:33:27] [INFO ] Removed a total of 8747 redundant transitions.
[2026-05-24 01:33:27] [INFO ] Flatten gal took : 577 ms
[2026-05-24 01:33:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 712 labels/synchronizations in 173 ms.
[2026-05-24 01:33:28] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5834107094659486206.gal : 31 ms
[2026-05-24 01:33:28] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4779878858797038367.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5834107094659486206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4779878858797038367.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability4779878858797038367.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 74
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :74 after 91688
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :91688 after 92033
Detected timeout of ITS tools.
[2026-05-24 01:33:31] [INFO ] Flatten gal took : 110 ms
[2026-05-24 01:33:31] [INFO ] Flatten gal took : 117 ms
[2026-05-24 01:33:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10460820700288424384.gal : 16 ms
[2026-05-24 01:33:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5370145785232706655.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10460820700288424384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5370145785232706655.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability5370145785232706655.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :9 after 25
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :25 after 33
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :33 after 85
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :85 after 290
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :290 after 436
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :436 after 1085
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :1085 after 4299
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :4299 after 6715
Detected timeout of ITS tools.
[2026-05-24 01:34:01] [INFO ] Flatten gal took : 121 ms
[2026-05-24 01:34:01] [INFO ] Applying decomposition
[2026-05-24 01:34:01] [INFO ] Flatten gal took : 106 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8041106883331084497.txt' '-o' '/tmp/graph8041106883331084497.bin' '-w' '/tmp/graph8041106883331084497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8041106883331084497.bin' '-l' '-1' '-v' '-w' '/tmp/graph8041106883331084497.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:34:02] [INFO ] Decomposing Gal with order
[2026-05-24 01:34:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:34:02] [INFO ] Removed a total of 8716 redundant transitions.
[2026-05-24 01:34:02] [INFO ] Flatten gal took : 480 ms
[2026-05-24 01:34:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 782 labels/synchronizations in 141 ms.
[2026-05-24 01:34:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1518132142527951616.gal : 22 ms
[2026-05-24 01:34:03] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12678027716106868544.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability1518132142527951616.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12678027716106868544.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability12678027716106868544.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 2165
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :2165 after 2176
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :2176 after 4637
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :4637 after 4808
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :4808 after 10740
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :10740 after 37437
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :37437 after 435437
Detected timeout of ITS tools.
[2026-05-24 01:34:33] [INFO ] Flatten gal took : 118 ms
[2026-05-24 01:34:33] [INFO ] Flatten gal took : 114 ms
[2026-05-24 01:34:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability795254455193308262.gal : 23 ms
[2026-05-24 01:34:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10602158785692066439.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability795254455193308262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10602158785692066439.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability10602158785692066439.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :9 after 25
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :25 after 33
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :33 after 85
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :85 after 290
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :290 after 436
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :436 after 1085
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :1085 after 4299
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :4299 after 6715
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :6715 after 17805
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :17805 after 84315
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :84315 after 137043
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is EisenbergMcGuire-PT-10, 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 r128-smll-177955743900183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 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 ;