About the Execution of 2024-gold for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15688.880 | 1800000.00 | 2638306.00 | 5750.80 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r098-smll-174860112300248.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is FireWire-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112300248
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 247K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1748686103341
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 10:08:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 10:08:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 10:08:25] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-05-31 10:08:25] [INFO ] Transformed 626 places.
[2025-05-31 10:08:25] [INFO ] Transformed 1031 transitions.
[2025-05-31 10:08:25] [INFO ] Found NUPN structural information;
[2025-05-31 10:08:25] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 370 ms.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 7 ms
Free SCC test removed 9 places
Structural test allowed to assert that 93 places are NOT stable. Took 40 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (463 resets) in 3523 ms. (11 steps per ms) remains 388/533 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 40 ms. (9 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 36 ms. (10 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 37 ms. (10 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 45 ms. (8 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 32 ms. (12 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 28 ms. (13 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 51 ms. (7 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
[2025-05-31 10:08:27] [INFO ] Flow matrix only has 1019 transitions (discarded 2 similar events)
// Phase 1: matrix 1019 rows 617 cols
[2025-05-31 10:08:27] [INFO ] Computed 13 invariants in 26 ms
[2025-05-31 10:08:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 388/388 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1636 variables, and 388 constraints, problems are : Problem set: 0 solved, 388 unsolved in 5129 ms.
Refiners :[Domain max(s): 388/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 388/388 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 229/617 variables, 13/401 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 229/630 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2025-05-31 10:08:37] [INFO ] Deduced a trap composed of 55 places in 646 ms of which 75 ms to minimize.
[2025-05-31 10:08:38] [INFO ] Deduced a trap composed of 358 places in 460 ms of which 8 ms to minimize.
SMT process timed out in 10781ms, After SMT, problems are : Problem set: 0 solved, 388 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 388 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1021/1021 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 611 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 611 transition count 957
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 550 transition count 955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 549 transition count 955
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 129 place count 549 transition count 945
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 149 place count 539 transition count 945
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 166 place count 522 transition count 926
Iterating global reduction 3 with 17 rules applied. Total rules applied 183 place count 522 transition count 926
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 522 transition count 923
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 189 place count 519 transition count 833
Iterating global reduction 4 with 3 rules applied. Total rules applied 192 place count 519 transition count 833
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 194 place count 519 transition count 831
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 248 place count 492 transition count 804
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 274 place count 479 transition count 825
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 291 place count 479 transition count 808
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 312 place count 462 transition count 804
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 317 place count 462 transition count 799
Applied a total of 317 rules in 298 ms. Remains 462 /617 variables (removed 155) and now considering 799/1021 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 462/617 places, 799/1021 transitions.
RANDOM walk for 4000000 steps (183733 resets) in 85181 ms. (46 steps per ms) remains 195/388 properties
BEST_FIRST walk for 40003 steps (334 resets) in 176 ms. (226 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (324 resets) in 136 ms. (291 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (331 resets) in 136 ms. (291 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (332 resets) in 139 ms. (285 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (340 resets) in 138 ms. (287 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (322 resets) in 135 ms. (294 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (328 resets) in 142 ms. (279 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (342 resets) in 143 ms. (277 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (334 resets) in 136 ms. (291 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (346 resets) in 139 ms. (285 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (340 resets) in 138 ms. (287 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (329 resets) in 141 ms. (281 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (322 resets) in 143 ms. (277 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (328 resets) in 138 ms. (287 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (337 resets) in 137 ms. (289 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (327 resets) in 137 ms. (289 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (308 resets) in 140 ms. (283 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (324 resets) in 137 ms. (289 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (356 resets) in 137 ms. (289 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (335 resets) in 137 ms. (289 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (331 resets) in 136 ms. (292 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (336 resets) in 141 ms. (281 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (343 resets) in 135 ms. (294 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40001 steps (343 resets) in 135 ms. (294 steps per ms) remains 194/195 properties
BEST_FIRST walk for 40003 steps (338 resets) in 134 ms. (296 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (330 resets) in 140 ms. (283 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (338 resets) in 181 ms. (219 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (329 resets) in 137 ms. (289 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (340 resets) in 135 ms. (294 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (348 resets) in 135 ms. (294 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (320 resets) in 140 ms. (283 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (325 resets) in 133 ms. (298 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (336 resets) in 136 ms. (291 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (339 resets) in 137 ms. (289 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (335 resets) in 138 ms. (287 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40002 steps (324 resets) in 142 ms. (279 steps per ms) remains 193/194 properties
BEST_FIRST walk for 40004 steps (355 resets) in 188 ms. (211 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (340 resets) in 151 ms. (263 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (331 resets) in 137 ms. (289 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (338 resets) in 141 ms. (281 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (338 resets) in 134 ms. (296 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (333 resets) in 135 ms. (294 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (334 resets) in 133 ms. (298 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (332 resets) in 135 ms. (294 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (325 resets) in 141 ms. (281 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (343 resets) in 131 ms. (303 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (331 resets) in 130 ms. (305 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (343 resets) in 130 ms. (305 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (347 resets) in 137 ms. (289 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (338 resets) in 128 ms. (310 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (326 resets) in 127 ms. (312 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (335 resets) in 130 ms. (305 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40002 steps (353 resets) in 145 ms. (273 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40003 steps (331 resets) in 195 ms. (204 steps per ms) remains 187/193 properties
BEST_FIRST walk for 40001 steps (327 resets) in 180 ms. (221 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (332 resets) in 179 ms. (222 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (327 resets) in 180 ms. (221 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (335 resets) in 185 ms. (215 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (351 resets) in 186 ms. (213 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (343 resets) in 179 ms. (222 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (329 resets) in 180 ms. (221 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (330 resets) in 179 ms. (222 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (332 resets) in 159 ms. (250 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (319 resets) in 126 ms. (314 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (358 resets) in 127 ms. (312 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (339 resets) in 125 ms. (317 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (338 resets) in 129 ms. (307 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (344 resets) in 134 ms. (296 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (339 resets) in 128 ms. (310 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (337 resets) in 127 ms. (312 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (336 resets) in 128 ms. (310 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (328 resets) in 133 ms. (298 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (336 resets) in 128 ms. (310 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (322 resets) in 127 ms. (312 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (338 resets) in 129 ms. (307 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (341 resets) in 129 ms. (307 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (319 resets) in 133 ms. (298 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (339 resets) in 127 ms. (312 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (338 resets) in 126 ms. (314 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (336 resets) in 129 ms. (307 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (333 resets) in 126 ms. (314 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (323 resets) in 132 ms. (300 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (328 resets) in 127 ms. (312 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (299 resets) in 131 ms. (303 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (327 resets) in 127 ms. (312 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (335 resets) in 138 ms. (287 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (337 resets) in 130 ms. (305 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (341 resets) in 127 ms. (312 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (345 resets) in 128 ms. (310 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (329 resets) in 128 ms. (310 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40002 steps (324 resets) in 131 ms. (303 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (322 resets) in 127 ms. (312 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (342 resets) in 131 ms. (303 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (332 resets) in 191 ms. (208 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (337 resets) in 197 ms. (202 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (349 resets) in 191 ms. (208 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (318 resets) in 189 ms. (210 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (326 resets) in 192 ms. (207 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (337 resets) in 191 ms. (208 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (344 resets) in 199 ms. (200 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (328 resets) in 192 ms. (207 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (332 resets) in 190 ms. (209 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40003 steps (330 resets) in 191 ms. (208 steps per ms) remains 187/187 properties
[2025-05-31 10:09:05] [INFO ] Flow matrix only has 796 transitions (discarded 3 similar events)
// Phase 1: matrix 796 rows 462 cols
[2025-05-31 10:09:05] [INFO ] Computed 10 invariants in 9 ms
[2025-05-31 10:09:05] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 243/430 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 20/450 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 794/1244 variables, 450/460 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 39/499 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 14/1258 variables, 12/511 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1258 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/1258 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 511 constraints, problems are : Problem set: 0 solved, 187 unsolved in 37002 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 462/462 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 243/430 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 10:09:43] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 4 ms to minimize.
[2025-05-31 10:09:43] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 3 ms to minimize.
[2025-05-31 10:09:43] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2025-05-31 10:09:44] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2025-05-31 10:09:44] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2025-05-31 10:09:44] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 2 ms to minimize.
[2025-05-31 10:09:44] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 1 ms to minimize.
[2025-05-31 10:09:45] [INFO ] Deduced a trap composed of 100 places in 74 ms of which 2 ms to minimize.
[2025-05-31 10:09:45] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2025-05-31 10:09:45] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 1 ms to minimize.
[2025-05-31 10:09:45] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2025-05-31 10:09:46] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 2 ms to minimize.
[2025-05-31 10:09:46] [INFO ] Deduced a trap composed of 109 places in 75 ms of which 2 ms to minimize.
[2025-05-31 10:09:46] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 2 ms to minimize.
[2025-05-31 10:09:46] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 2 ms to minimize.
[2025-05-31 10:09:47] [INFO ] Deduced a trap composed of 108 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 10:09:48] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 3 ms to minimize.
[2025-05-31 10:09:48] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2025-05-31 10:09:48] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 10:09:50] [INFO ] Deduced a trap composed of 103 places in 80 ms of which 2 ms to minimize.
[2025-05-31 10:09:51] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 3 ms to minimize.
[2025-05-31 10:09:51] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 3 ms to minimize.
[2025-05-31 10:09:52] [INFO ] Deduced a trap composed of 109 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 20/450 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 10:09:55] [INFO ] Deduced a trap composed of 124 places in 452 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 794/1244 variables, 450/484 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1244 variables, 39/523 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1244 variables, 187/710 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2025-05-31 10:10:09] [INFO ] Deduced a trap composed of 56 places in 369 ms of which 5 ms to minimize.
[2025-05-31 10:10:14] [INFO ] Deduced a trap composed of 79 places in 506 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1244 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1244/1258 variables, and 712 constraints, problems are : Problem set: 0 solved, 187 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 450/462 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 26/26 constraints]
After SMT, in 82099ms problems are : Problem set: 0 solved, 187 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 187 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 799/799 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 462 transition count 748
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 411 transition count 748
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 102 place count 411 transition count 745
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 408 transition count 745
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 122 place count 394 transition count 728
Iterating global reduction 2 with 14 rules applied. Total rules applied 136 place count 394 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 391 transition count 722
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 391 transition count 722
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 388 transition count 719
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 388 transition count 719
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 388 transition count 713
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 157 place count 385 transition count 713
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 17 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 211 place count 358 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 358 transition count 685
Performed 20 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 252 place count 338 transition count 733
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 257 place count 338 transition count 728
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 276 place count 338 transition count 709
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 283 place count 338 transition count 702
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 290 place count 331 transition count 702
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 293 place count 331 transition count 907
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 296 place count 328 transition count 907
Applied a total of 296 rules in 262 ms. Remains 328 /462 variables (removed 134) and now considering 907/799 (removed -108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 328/462 places, 907/799 transitions.
RANDOM walk for 4000000 steps (90713 resets) in 51418 ms. (77 steps per ms) remains 60/187 properties
BEST_FIRST walk for 400003 steps (1883 resets) in 858 ms. (465 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (1899 resets) in 863 ms. (462 steps per ms) remains 57/60 properties
BEST_FIRST walk for 400001 steps (1859 resets) in 858 ms. (465 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (1876 resets) in 854 ms. (467 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (1860 resets) in 852 ms. (468 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (1838 resets) in 852 ms. (468 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (1909 resets) in 851 ms. (469 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400002 steps (1880 resets) in 860 ms. (464 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400002 steps (1886 resets) in 840 ms. (475 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (1902 resets) in 850 ms. (470 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (1892 resets) in 849 ms. (470 steps per ms) remains 55/57 properties
BEST_FIRST walk for 400004 steps (1892 resets) in 848 ms. (471 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1889 resets) in 837 ms. (477 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (1889 resets) in 835 ms. (478 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1871 resets) in 846 ms. (472 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (1860 resets) in 845 ms. (472 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1886 resets) in 846 ms. (472 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1909 resets) in 834 ms. (479 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1883 resets) in 850 ms. (470 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1896 resets) in 843 ms. (473 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1932 resets) in 846 ms. (472 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (1884 resets) in 841 ms. (475 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1891 resets) in 840 ms. (475 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1879 resets) in 848 ms. (471 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (1914 resets) in 840 ms. (475 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (1877 resets) in 849 ms. (470 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1883 resets) in 849 ms. (470 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (1908 resets) in 838 ms. (476 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (1881 resets) in 843 ms. (473 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (1922 resets) in 850 ms. (470 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400004 steps (1880 resets) in 833 ms. (479 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1918 resets) in 855 ms. (467 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (1856 resets) in 861 ms. (464 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (1854 resets) in 832 ms. (480 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1888 resets) in 830 ms. (481 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1898 resets) in 841 ms. (475 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400000 steps (1886 resets) in 843 ms. (473 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1886 resets) in 837 ms. (477 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1927 resets) in 833 ms. (479 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1866 resets) in 829 ms. (481 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1872 resets) in 834 ms. (479 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1894 resets) in 840 ms. (475 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (1898 resets) in 841 ms. (475 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1908 resets) in 829 ms. (481 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1875 resets) in 840 ms. (475 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1908 resets) in 843 ms. (473 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1875 resets) in 834 ms. (479 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1879 resets) in 839 ms. (476 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (1873 resets) in 832 ms. (480 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1866 resets) in 852 ms. (468 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1873 resets) in 830 ms. (481 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1914 resets) in 827 ms. (483 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1886 resets) in 822 ms. (486 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1859 resets) in 828 ms. (482 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (1890 resets) in 847 ms. (471 steps per ms) remains 54/54 properties
[2025-05-31 10:10:53] [INFO ] Flow matrix only has 899 transitions (discarded 8 similar events)
// Phase 1: matrix 899 rows 328 cols
[2025-05-31 10:10:53] [INFO ] Computed 10 invariants in 4 ms
[2025-05-31 10:10:53] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 209/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 45/308 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 892/1200 variables, 308/318 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1200 variables, 100/418 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1200 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 24/1224 variables, 17/435 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1224 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 3/1227 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/1227 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 438 constraints, problems are : Problem set: 0 solved, 54 unsolved in 8591 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 328/328 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 209/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 45/308 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2025-05-31 10:11:03] [INFO ] Deduced a trap composed of 71 places in 447 ms of which 6 ms to minimize.
[2025-05-31 10:11:03] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 3 ms to minimize.
[2025-05-31 10:11:03] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 3 ms to minimize.
[2025-05-31 10:11:04] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2025-05-31 10:11:04] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2025-05-31 10:11:04] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2025-05-31 10:11:05] [INFO ] Deduced a trap composed of 85 places in 401 ms of which 5 ms to minimize.
[2025-05-31 10:11:05] [INFO ] Deduced a trap composed of 192 places in 406 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 892/1200 variables, 308/326 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1200 variables, 100/426 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1200 variables, 54/480 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2025-05-31 10:11:10] [INFO ] Deduced a trap composed of 74 places in 481 ms of which 5 ms to minimize.
[2025-05-31 10:11:10] [INFO ] Deduced a trap composed of 72 places in 473 ms of which 6 ms to minimize.
[2025-05-31 10:11:11] [INFO ] Deduced a trap composed of 39 places in 454 ms of which 5 ms to minimize.
[2025-05-31 10:11:12] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1200 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2025-05-31 10:11:16] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1200 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1200 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 24/1224 variables, 17/502 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1224 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 3/1227 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1227 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 16 (OVERLAPS) 0/1227 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 505 constraints, problems are : Problem set: 0 solved, 54 unsolved in 35722 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 328/328 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 13/13 constraints]
After SMT, in 44355ms problems are : Problem set: 0 solved, 54 unsolved
Parikh walk visited 0 properties in 11421 ms.
Support contains 54 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 907/907 transitions.
Graph (complete) has 1435 edges and 328 vertex of which 325 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 325 transition count 898
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 319 transition count 898
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 319 transition count 895
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 316 transition count 895
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 48 place count 290 transition count 869
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 290 transition count 869
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 74 place count 290 transition count 866
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 287 transition count 866
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 98 place count 269 transition count 839
Iterating global reduction 2 with 18 rules applied. Total rules applied 116 place count 269 transition count 839
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 266 transition count 833
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 266 transition count 833
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 160 place count 247 transition count 814
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 167 place count 240 transition count 789
Iterating global reduction 2 with 7 rules applied. Total rules applied 174 place count 240 transition count 789
Performed 11 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 196 place count 229 transition count 795
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 202 place count 229 transition count 789
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 203 place count 229 transition count 788
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 204 place count 228 transition count 788
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 211 place count 228 transition count 788
Applied a total of 211 rules in 138 ms. Remains 228 /328 variables (removed 100) and now considering 788/907 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 228/328 places, 788/907 transitions.
RANDOM walk for 4000000 steps (90821 resets) in 37017 ms. (108 steps per ms) remains 52/54 properties
BEST_FIRST walk for 400002 steps (1905 resets) in 1504 ms. (265 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1854 resets) in 1597 ms. (250 steps per ms) remains 50/52 properties
BEST_FIRST walk for 400004 steps (1893 resets) in 1655 ms. (241 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1889 resets) in 1845 ms. (216 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1934 resets) in 1666 ms. (239 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1883 resets) in 1417 ms. (282 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1871 resets) in 1722 ms. (232 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1872 resets) in 1670 ms. (239 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1903 resets) in 1530 ms. (261 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1903 resets) in 1564 ms. (255 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1871 resets) in 1593 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1923 resets) in 1745 ms. (229 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1890 resets) in 1720 ms. (232 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1858 resets) in 1431 ms. (279 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1892 resets) in 2056 ms. (194 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1884 resets) in 1865 ms. (214 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1870 resets) in 1580 ms. (253 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1899 resets) in 2109 ms. (189 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1887 resets) in 1714 ms. (233 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1864 resets) in 1892 ms. (211 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1898 resets) in 1708 ms. (234 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1884 resets) in 1421 ms. (281 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1906 resets) in 1692 ms. (236 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1897 resets) in 1633 ms. (244 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1910 resets) in 1739 ms. (229 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1886 resets) in 1676 ms. (238 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1897 resets) in 1687 ms. (236 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1896 resets) in 1946 ms. (205 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (1908 resets) in 1662 ms. (240 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1906 resets) in 1310 ms. (305 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1851 resets) in 1563 ms. (255 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1913 resets) in 1979 ms. (202 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1850 resets) in 1434 ms. (278 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1872 resets) in 1615 ms. (247 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400000 steps (1902 resets) in 1602 ms. (249 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1863 resets) in 1753 ms. (228 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1877 resets) in 1937 ms. (206 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1857 resets) in 1516 ms. (263 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1871 resets) in 1630 ms. (245 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1858 resets) in 1608 ms. (248 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1902 resets) in 1379 ms. (289 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1901 resets) in 1431 ms. (279 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1881 resets) in 1457 ms. (274 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1883 resets) in 1803 ms. (221 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1862 resets) in 1609 ms. (248 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1913 resets) in 1568 ms. (254 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1845 resets) in 1514 ms. (264 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1869 resets) in 1478 ms. (270 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1850 resets) in 2072 ms. (192 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1876 resets) in 1459 ms. (273 steps per ms) remains 50/50 properties
Interrupted probabilistic random walk after 8209479 steps, run timeout after 132001 ms. (steps per millisecond=62 ) properties seen :20 out of 50
Probabilistic random walk after 8209479 steps, saw 2419839 distinct states, run finished after 132011 ms. (steps per millisecond=62 ) properties seen :20
[2025-05-31 10:14:45] [INFO ] Flow matrix only has 780 transitions (discarded 8 similar events)
// Phase 1: matrix 780 rows 228 cols
[2025-05-31 10:14:45] [INFO ] Computed 10 invariants in 5 ms
[2025-05-31 10:14:45] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 85/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 92/207 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 780/987 variables, 207/217 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 98/315 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/987 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 21/1008 variables, 21/336 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/1008 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 336 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1821 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 85/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 92/207 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-05-31 10:14:47] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2025-05-31 10:14:48] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 2 ms to minimize.
[2025-05-31 10:14:48] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2025-05-31 10:14:48] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2025-05-31 10:14:48] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2025-05-31 10:14:48] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 780/987 variables, 207/223 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/987 variables, 98/321 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/987 variables, 30/351 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/987 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 21/1008 variables, 21/372 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1008 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/1008 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 372 constraints, problems are : Problem set: 0 solved, 30 unsolved in 4111 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 6/6 constraints]
After SMT, in 5957ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 7527 ms.
Support contains 30 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 788/788 transitions.
Graph (complete) has 1245 edges and 228 vertex of which 224 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 787
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 223 transition count 787
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 7 place count 219 transition count 783
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 219 transition count 783
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 217 transition count 781
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 215 transition count 779
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 215 transition count 779
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 214 transition count 784
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 213 transition count 770
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 213 transition count 770
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 212 transition count 768
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 212 transition count 768
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 211 transition count 761
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 211 transition count 761
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 210 transition count 759
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 210 transition count 759
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 209 transition count 752
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 209 transition count 752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 208 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 208 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 207 transition count 743
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 207 transition count 743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 206 transition count 741
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 206 transition count 741
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 205 transition count 734
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 205 transition count 734
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 204 transition count 732
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 204 transition count 732
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 203 transition count 728
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 203 transition count 728
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 202 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 202 transition count 726
Applied a total of 45 rules in 143 ms. Remains 202 /228 variables (removed 26) and now considering 726/788 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 202/228 places, 726/788 transitions.
RANDOM walk for 4000000 steps (90608 resets) in 52815 ms. (75 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1877 resets) in 1835 ms. (217 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1856 resets) in 1706 ms. (234 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1873 resets) in 1656 ms. (241 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1869 resets) in 1503 ms. (265 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1894 resets) in 1452 ms. (275 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1863 resets) in 1870 ms. (213 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1862 resets) in 1588 ms. (251 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1871 resets) in 1493 ms. (267 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1852 resets) in 1575 ms. (253 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1890 resets) in 1383 ms. (289 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1905 resets) in 1366 ms. (292 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1910 resets) in 1217 ms. (328 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1908 resets) in 1217 ms. (328 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1908 resets) in 1835 ms. (217 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1897 resets) in 1595 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1869 resets) in 1603 ms. (249 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1873 resets) in 1321 ms. (302 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1908 resets) in 1412 ms. (283 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1870 resets) in 1203 ms. (332 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1892 resets) in 1221 ms. (327 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1850 resets) in 1930 ms. (207 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1883 resets) in 1653 ms. (241 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1907 resets) in 1388 ms. (287 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1891 resets) in 1423 ms. (280 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1900 resets) in 1450 ms. (275 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1882 resets) in 1296 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1886 resets) in 1682 ms. (237 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1879 resets) in 1521 ms. (262 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1909 resets) in 1265 ms. (315 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1855 resets) in 1168 ms. (342 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 7264626 steps, run timeout after 111001 ms. (steps per millisecond=65 ) properties seen :0 out of 30
Probabilistic random walk after 7264626 steps, saw 2124853 distinct states, run finished after 111002 ms. (steps per millisecond=65 ) properties seen :0
[2025-05-31 10:17:27] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:17:27] [INFO ] Computed 10 invariants in 5 ms
[2025-05-31 10:17:27] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 85/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/189 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 718/907 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 93/292 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 13/920 variables, 13/305 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2169 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 85/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/189 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-05-31 10:17:30] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
[2025-05-31 10:17:30] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2025-05-31 10:17:30] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2025-05-31 10:17:30] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 718/907 variables, 189/203 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 30/326 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/907 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 13/920 variables, 13/339 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-05-31 10:17:32] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/920 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/920 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 340 constraints, problems are : Problem set: 0 solved, 30 unsolved in 4818 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
After SMT, in 7013ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 0 properties in 3068 ms.
Support contains 30 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Applied a total of 0 rules in 23 ms. Remains 202 /202 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 202/202 places, 726/726 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Applied a total of 0 rules in 12 ms. Remains 202 /202 variables (removed 0) and now considering 726/726 (removed 0) transitions.
[2025-05-31 10:17:38] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:17:38] [INFO ] Invariant cache hit.
[2025-05-31 10:17:38] [INFO ] Implicit Places using invariants in 316 ms returned []
[2025-05-31 10:17:38] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:17:38] [INFO ] Invariant cache hit.
[2025-05-31 10:17:38] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-31 10:17:39] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
[2025-05-31 10:17:39] [INFO ] Redundant transitions in 70 ms returned []
Running 718 sub problems to find dead transitions.
[2025-05-31 10:17:39] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:17:39] [INFO ] Invariant cache hit.
[2025-05-31 10:17:39] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2025-05-31 10:17:48] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2025-05-31 10:17:49] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2025-05-31 10:17:49] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2025-05-31 10:17:49] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2025-05-31 10:17:49] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 14 ms to minimize.
[2025-05-31 10:17:49] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2025-05-31 10:17:50] [INFO ] Deduced a trap composed of 110 places in 222 ms of which 3 ms to minimize.
[2025-05-31 10:17:50] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2025-05-31 10:17:50] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2025-05-31 10:17:51] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2025-05-31 10:17:53] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 3 ms to minimize.
[2025-05-31 10:17:53] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 3 ms to minimize.
[2025-05-31 10:17:54] [INFO ] Deduced a trap composed of 110 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2025-05-31 10:17:56] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 2 ms to minimize.
[2025-05-31 10:18:00] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (OVERLAPS) 718/918 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/920 variables, and 318 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (OVERLAPS) 718/918 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 93/318 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 710/1028 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/920 variables, and 1028 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 710/718 constraints, Known Traps: 15/15 constraints]
After SMT, in 62230ms problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 62255ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63639 ms. Remains : 202/202 places, 726/726 transitions.
RANDOM walk for 400000 steps (9119 resets) in 7779 ms. (51 steps per ms) remains 30/30 properties
Running SMT prover for 30 properties.
[2025-05-31 10:18:44] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:18:44] [INFO ] Invariant cache hit.
[2025-05-31 10:18:44] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 10:18:44] [INFO ] After 281ms SMT Verify possible using state equation in real domain returned unsat :0 sat :30
[2025-05-31 10:18:44] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-31 10:18:44] [INFO ] After 154ms SMT Verify possible using 93 Read/Feed constraints in real domain returned unsat :0 sat :30
TRAPS : Iteration 0
[2025-05-31 10:18:46] [INFO ] After 1778ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:30
[2025-05-31 10:18:46] [INFO ] After 2178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2025-05-31 10:18:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 10:18:46] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2025-05-31 10:18:47] [INFO ] After 316ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :30
TRAPS : Iteration 0
[2025-05-31 10:18:47] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 2 ms to minimize.
[2025-05-31 10:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2025-05-31 10:18:47] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2025-05-31 10:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 1
[2025-05-31 10:18:49] [INFO ] After 3127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
[2025-05-31 10:18:50] [INFO ] After 3688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
RANDOM walk for 4000000 steps (90663 resets) in 47870 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1886 resets) in 1452 ms. (275 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1913 resets) in 1543 ms. (259 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1885 resets) in 1779 ms. (224 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1875 resets) in 1293 ms. (309 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1870 resets) in 1312 ms. (304 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1882 resets) in 1444 ms. (276 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1885 resets) in 1344 ms. (297 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1913 resets) in 1601 ms. (249 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1920 resets) in 1336 ms. (299 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1886 resets) in 1280 ms. (312 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1890 resets) in 1648 ms. (242 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1902 resets) in 1846 ms. (216 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1898 resets) in 1324 ms. (301 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1874 resets) in 1360 ms. (293 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1883 resets) in 1720 ms. (232 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1890 resets) in 1674 ms. (238 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1894 resets) in 1605 ms. (249 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1895 resets) in 1234 ms. (323 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1888 resets) in 1585 ms. (252 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1892 resets) in 1398 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1886 resets) in 1882 ms. (212 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1924 resets) in 1316 ms. (303 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1902 resets) in 1417 ms. (282 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400000 steps (1917 resets) in 1126 ms. (354 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1894 resets) in 1239 ms. (322 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1900 resets) in 1123 ms. (355 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1874 resets) in 1783 ms. (224 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1900 resets) in 1569 ms. (254 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1898 resets) in 1320 ms. (302 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1916 resets) in 1251 ms. (319 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 6248384 steps, run timeout after 99001 ms. (steps per millisecond=63 ) properties seen :0 out of 30
Probabilistic random walk after 6248384 steps, saw 1825644 distinct states, run finished after 99001 ms. (steps per millisecond=63 ) properties seen :0
[2025-05-31 10:21:02] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:21:02] [INFO ] Invariant cache hit.
[2025-05-31 10:21:02] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 85/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/189 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 718/907 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 93/292 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 13/920 variables, 13/305 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1886 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 85/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/189 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-05-31 10:21:05] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
[2025-05-31 10:21:05] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 2 ms to minimize.
[2025-05-31 10:21:05] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 718/907 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 93/295 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 30/325 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/907 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 13/920 variables, 13/338 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 338 constraints, problems are : Problem set: 0 solved, 30 unsolved in 4092 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 3/3 constraints]
After SMT, in 5998ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 7907 ms.
Support contains 30 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Applied a total of 0 rules in 12 ms. Remains 202 /202 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 202/202 places, 726/726 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Applied a total of 0 rules in 10 ms. Remains 202 /202 variables (removed 0) and now considering 726/726 (removed 0) transitions.
[2025-05-31 10:21:16] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:21:16] [INFO ] Invariant cache hit.
[2025-05-31 10:21:16] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-31 10:21:16] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:21:16] [INFO ] Invariant cache hit.
[2025-05-31 10:21:17] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-31 10:21:17] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2025-05-31 10:21:17] [INFO ] Redundant transitions in 11 ms returned []
Running 718 sub problems to find dead transitions.
[2025-05-31 10:21:17] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:21:17] [INFO ] Invariant cache hit.
[2025-05-31 10:21:17] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2025-05-31 10:21:26] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2025-05-31 10:21:26] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2025-05-31 10:21:27] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2025-05-31 10:21:27] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2025-05-31 10:21:27] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 2 ms to minimize.
[2025-05-31 10:21:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2025-05-31 10:21:27] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 2 ms to minimize.
[2025-05-31 10:21:28] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2025-05-31 10:21:28] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2025-05-31 10:21:29] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 2 ms to minimize.
[2025-05-31 10:21:30] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 2 ms to minimize.
[2025-05-31 10:21:30] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 2 ms to minimize.
[2025-05-31 10:21:31] [INFO ] Deduced a trap composed of 110 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2025-05-31 10:21:33] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 3 ms to minimize.
[2025-05-31 10:21:37] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (OVERLAPS) 718/918 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 93/318 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/920 variables, and 318 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (OVERLAPS) 718/918 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 93/318 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 710/1028 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/920 variables, and 1028 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 710/718 constraints, Known Traps: 15/15 constraints]
After SMT, in 61440ms problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 61450ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62613 ms. Remains : 202/202 places, 726/726 transitions.
RANDOM walk for 400000 steps (8988 resets) in 3245 ms. (123 steps per ms) remains 30/30 properties
Running SMT prover for 30 properties.
[2025-05-31 10:22:20] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:22:20] [INFO ] Invariant cache hit.
[2025-05-31 10:22:20] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-31 10:22:20] [INFO ] After 347ms SMT Verify possible using state equation in real domain returned unsat :0 sat :30
[2025-05-31 10:22:20] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-31 10:22:21] [INFO ] After 235ms SMT Verify possible using 93 Read/Feed constraints in real domain returned unsat :0 sat :30
TRAPS : Iteration 0
[2025-05-31 10:22:22] [INFO ] After 1466ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:30
[2025-05-31 10:22:22] [INFO ] After 1899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2025-05-31 10:22:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 10:22:22] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2025-05-31 10:22:22] [INFO ] After 292ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :30
TRAPS : Iteration 0
[2025-05-31 10:22:23] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 2 ms to minimize.
[2025-05-31 10:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-05-31 10:22:23] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2025-05-31 10:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
TRAPS : Iteration 1
[2025-05-31 10:22:25] [INFO ] After 2579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
[2025-05-31 10:22:25] [INFO ] After 3037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
RANDOM walk for 40000 steps (920 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (195 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 622680 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 1
Probabilistic random walk after 622680 steps, saw 185394 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
[2025-05-31 10:22:28] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
[2025-05-31 10:22:28] [INFO ] Invariant cache hit.
[2025-05-31 10:22:28] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:22:29] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 2 ms to minimize.
[2025-05-31 10:22:29] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 2 ms to minimize.
[2025-05-31 10:22:29] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 2 ms to minimize.
[2025-05-31 10:22:29] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 2 ms to minimize.
[2025-05-31 10:22:29] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1818ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 199 transition count 725
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 198 transition count 724
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 198 transition count 724
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 196 transition count 722
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 194 transition count 720
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 194 transition count 720
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 725
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 192 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 192 transition count 711
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 191 transition count 709
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 191 transition count 709
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 190 transition count 702
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 190 transition count 702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 189 transition count 700
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 189 transition count 700
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 682
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 669
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 669
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 667
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 181 transition count 667
Applied a total of 40 rules in 83 ms. Remains 181 /202 variables (removed 21) and now considering 667/726 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 181/202 places, 667/726 transitions.
RANDOM walk for 40000 steps (898 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (188 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 762142 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 1
Probabilistic random walk after 762142 steps, saw 169488 distinct states, run finished after 3009 ms. (steps per millisecond=253 ) properties seen :0
[2025-05-31 10:22:33] [INFO ] Flow matrix only has 659 transitions (discarded 8 similar events)
// Phase 1: matrix 659 rows 181 cols
[2025-05-31 10:22:33] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 10:22:33] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 659/828 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 88/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/840 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:22:34] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 659/828 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 88/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/840 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/840 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 667/667 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 181/181 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 667/667 transitions.
Applied a total of 0 rules in 8 ms. Remains 181 /181 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2025-05-31 10:22:34] [INFO ] Flow matrix only has 659 transitions (discarded 8 similar events)
[2025-05-31 10:22:34] [INFO ] Invariant cache hit.
[2025-05-31 10:22:34] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-31 10:22:34] [INFO ] Flow matrix only has 659 transitions (discarded 8 similar events)
[2025-05-31 10:22:34] [INFO ] Invariant cache hit.
[2025-05-31 10:22:34] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-31 10:22:35] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2025-05-31 10:22:35] [INFO ] Redundant transitions in 9 ms returned []
Running 659 sub problems to find dead transitions.
[2025-05-31 10:22:35] [INFO ] Flow matrix only has 659 transitions (discarded 8 similar events)
[2025-05-31 10:22:35] [INFO ] Invariant cache hit.
[2025-05-31 10:22:35] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2025-05-31 10:22:42] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2025-05-31 10:22:42] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 2 ms to minimize.
[2025-05-31 10:22:42] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2025-05-31 10:22:42] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2025-05-31 10:22:43] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
[2025-05-31 10:22:43] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 2 ms to minimize.
[2025-05-31 10:22:43] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2025-05-31 10:22:44] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 2 ms to minimize.
[2025-05-31 10:22:45] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 2 ms to minimize.
[2025-05-31 10:22:45] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 2 ms to minimize.
[2025-05-31 10:22:46] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (OVERLAPS) 659/840 variables, 181/202 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 88/290 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 290 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (OVERLAPS) 659/840 variables, 181/202 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 88/290 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 659/949 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 949 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 11/11 constraints]
After SMT, in 61316ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 61325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62200 ms. Remains : 181/181 places, 667/667 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 181 vertex of which 35 / 181 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 490
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 150 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 149 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 149 transition count 470
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 149 transition count 468
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 147 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 147 transition count 456
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 147 transition count 450
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 141 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 141 transition count 440
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 141 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 138 transition count 437
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 138 transition count 437
Applied a total of 76 rules in 87 ms. Remains 138 /181 variables (removed 43) and now considering 437/667 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:23:36] [INFO ] Flow matrix only has 433 transitions (discarded 4 similar events)
// Phase 1: matrix 433 rows 138 cols
[2025-05-31 10:23:36] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:23:36] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:23:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-31 10:23:37] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:23:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:23:37] [INFO ] After 35ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:23:37] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:23:37] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 468 ms.
RANDOM walk for 40000 steps (887 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (186 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 571106 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 571106 steps, saw 169665 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2025-05-31 10:23:40] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:23:40] [INFO ] Computed 10 invariants in 7 ms
[2025-05-31 10:23:40] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:23:40] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 3 ms to minimize.
[2025-05-31 10:23:40] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:23:41] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/905 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/920 variables, 15/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/920 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/920 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 196 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 195 transition count 721
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 195 transition count 721
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 193 transition count 731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 192 transition count 717
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 192 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 191 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 191 transition count 715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 190 transition count 708
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 190 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 189 transition count 706
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 189 transition count 706
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 699
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 697
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 688
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 688
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 679
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 673
Applied a total of 39 rules in 93 ms. Remains 181 /202 variables (removed 21) and now considering 673/726 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 181/202 places, 673/726 transitions.
RANDOM walk for 40000 steps (909 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (197 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 784913 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 1
Probabilistic random walk after 784913 steps, saw 173947 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
[2025-05-31 10:23:45] [INFO ] Flow matrix only has 665 transitions (discarded 8 similar events)
// Phase 1: matrix 665 rows 181 cols
[2025-05-31 10:23:45] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 10:23:45] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/834 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 89/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/846 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/846 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 846/846 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:23:45] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2025-05-31 10:23:46] [INFO ] Deduced a trap composed of 83 places in 332 ms of which 3 ms to minimize.
[2025-05-31 10:23:46] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/834 variables, 169/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/834 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/846 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/846 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 846/846 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1194 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1491ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 673/673 transitions.
Applied a total of 0 rules in 15 ms. Remains 181 /181 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 181/181 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 673/673 transitions.
Applied a total of 0 rules in 13 ms. Remains 181 /181 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2025-05-31 10:23:46] [INFO ] Flow matrix only has 665 transitions (discarded 8 similar events)
[2025-05-31 10:23:46] [INFO ] Invariant cache hit.
[2025-05-31 10:23:46] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-05-31 10:23:46] [INFO ] Flow matrix only has 665 transitions (discarded 8 similar events)
[2025-05-31 10:23:46] [INFO ] Invariant cache hit.
[2025-05-31 10:23:47] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-05-31 10:23:48] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
[2025-05-31 10:23:48] [INFO ] Redundant transitions in 16 ms returned []
Running 665 sub problems to find dead transitions.
[2025-05-31 10:23:48] [INFO ] Flow matrix only has 665 transitions (discarded 8 similar events)
[2025-05-31 10:23:48] [INFO ] Invariant cache hit.
[2025-05-31 10:23:48] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-05-31 10:23:57] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2025-05-31 10:23:58] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2025-05-31 10:23:58] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 3 ms to minimize.
[2025-05-31 10:23:58] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 3 ms to minimize.
[2025-05-31 10:23:58] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2025-05-31 10:23:59] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 3 ms to minimize.
[2025-05-31 10:23:59] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2025-05-31 10:24:00] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 3 ms to minimize.
[2025-05-31 10:24:02] [INFO ] Deduced a trap composed of 43 places in 296 ms of which 3 ms to minimize.
[2025-05-31 10:24:04] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 3 ms to minimize.
[2025-05-31 10:24:04] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2025-05-31 10:24:11] [INFO ] Deduced a trap composed of 51 places in 279 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 665 unsolved
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 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.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 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/846 variables, and 22 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/181 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (OVERLAPS) 665/846 variables, 181/203 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/846 variables, 89/292 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 665/957 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 846/846 variables, and 957 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 12/12 constraints]
After SMT, in 61649ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 61663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63087 ms. Remains : 181/181 places, 673/673 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 181 vertex of which 35 / 181 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 496
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 150 transition count 489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 149 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 149 transition count 476
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 149 transition count 474
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 147 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 147 transition count 462
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 147 transition count 456
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 141 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 141 transition count 446
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 141 transition count 443
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 138 transition count 443
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 78 place count 138 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 138 transition count 442
Applied a total of 79 rules in 56 ms. Remains 138 /181 variables (removed 43) and now considering 442/673 (removed 231) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:24:49] [INFO ] Flow matrix only has 438 transitions (discarded 4 similar events)
// Phase 1: matrix 438 rows 138 cols
[2025-05-31 10:24:49] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:24:49] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:24:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 10:24:50] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:24:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:24:50] [INFO ] After 17ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:24:50] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:24:50] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 385 ms.
RANDOM walk for 40000 steps (907 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (188 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 599336 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 1
Probabilistic random walk after 599336 steps, saw 178430 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2025-05-31 10:24:53] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:24:53] [INFO ] Computed 10 invariants in 9 ms
[2025-05-31 10:24:53] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:24:53] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:24:54] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/905 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/920 variables, 15/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/920 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/920 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1231ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 194 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 194 transition count 720
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 725
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 192 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 192 transition count 711
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 191 transition count 709
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 191 transition count 709
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 190 transition count 702
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 190 transition count 702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 189 transition count 700
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 189 transition count 700
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 682
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 669
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 669
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 667
Applied a total of 39 rules in 90 ms. Remains 181 /202 variables (removed 21) and now considering 667/726 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 181/202 places, 667/726 transitions.
RANDOM walk for 40000 steps (898 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (188 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 782416 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 1
Probabilistic random walk after 782416 steps, saw 173488 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
[2025-05-31 10:24:57] [INFO ] Flow matrix only has 659 transitions (discarded 8 similar events)
// Phase 1: matrix 659 rows 181 cols
[2025-05-31 10:24:57] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 10:24:57] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 659/828 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 88/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/840 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:24:58] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 659/828 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 88/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/840 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/840 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 667/667 transitions.
Applied a total of 0 rules in 13 ms. Remains 181 /181 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 181/181 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 667/667 transitions.
Applied a total of 0 rules in 13 ms. Remains 181 /181 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2025-05-31 10:24:58] [INFO ] Flow matrix only has 659 transitions (discarded 8 similar events)
[2025-05-31 10:24:58] [INFO ] Invariant cache hit.
[2025-05-31 10:24:59] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-05-31 10:24:59] [INFO ] Flow matrix only has 659 transitions (discarded 8 similar events)
[2025-05-31 10:24:59] [INFO ] Invariant cache hit.
[2025-05-31 10:24:59] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-31 10:25:00] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2025-05-31 10:25:00] [INFO ] Redundant transitions in 14 ms returned []
Running 659 sub problems to find dead transitions.
[2025-05-31 10:25:00] [INFO ] Flow matrix only has 659 transitions (discarded 8 similar events)
[2025-05-31 10:25:00] [INFO ] Invariant cache hit.
[2025-05-31 10:25:00] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2025-05-31 10:25:11] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2025-05-31 10:25:11] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 4 ms to minimize.
[2025-05-31 10:25:11] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2025-05-31 10:25:11] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2025-05-31 10:25:12] [INFO ] Deduced a trap composed of 98 places in 258 ms of which 3 ms to minimize.
[2025-05-31 10:25:12] [INFO ] Deduced a trap composed of 98 places in 249 ms of which 3 ms to minimize.
[2025-05-31 10:25:13] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2025-05-31 10:25:14] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 3 ms to minimize.
[2025-05-31 10:25:15] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 2 ms to minimize.
[2025-05-31 10:25:16] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 2 ms to minimize.
[2025-05-31 10:25:17] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (OVERLAPS) 659/840 variables, 181/202 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 88/290 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 290 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2025-05-31 10:25:42] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (OVERLAPS) 659/840 variables, 181/203 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 88/291 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 659/950 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 950 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 12/12 constraints]
After SMT, in 61621ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 61637ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63522 ms. Remains : 181/181 places, 667/667 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 181 vertex of which 35 / 181 are part of one of the 7 SCC in 2 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 490
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 150 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 149 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 149 transition count 470
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 149 transition count 468
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 147 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 147 transition count 456
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 147 transition count 450
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 141 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 141 transition count 440
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 141 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 138 transition count 437
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 138 transition count 437
Applied a total of 77 rules in 79 ms. Remains 138 /181 variables (removed 43) and now considering 437/667 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:26:02] [INFO ] Flow matrix only has 433 transitions (discarded 4 similar events)
// Phase 1: matrix 433 rows 138 cols
[2025-05-31 10:26:02] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 10:26:02] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:26:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 10:26:02] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:26:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:26:02] [INFO ] After 56ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:26:03] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
[2025-05-31 10:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
TRAPS : Iteration 1
[2025-05-31 10:26:03] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:26:03] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 809 ms.
RANDOM walk for 40000 steps (931 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (189 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 534842 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 534842 steps, saw 159549 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2025-05-31 10:26:06] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:26:06] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:26:06] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:26:06] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 940ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 725
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 199 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 192 transition count 724
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 191 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 191 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 190 transition count 708
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 190 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 189 transition count 701
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 188 transition count 699
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 188 transition count 699
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 187 transition count 692
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 187 transition count 692
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 186 transition count 690
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 186 transition count 690
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 185 transition count 683
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 185 transition count 683
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 184 transition count 681
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 184 transition count 681
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 183 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 183 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 182 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 182 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 181 transition count 668
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 181 transition count 668
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 180 transition count 666
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 180 transition count 666
Applied a total of 41 rules in 77 ms. Remains 180 /202 variables (removed 22) and now considering 666/726 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 180/202 places, 666/726 transitions.
RANDOM walk for 40000 steps (900 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (185 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 622994 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 1
Probabilistic random walk after 622994 steps, saw 139890 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
[2025-05-31 10:26:10] [INFO ] Flow matrix only has 658 transitions (discarded 8 similar events)
// Phase 1: matrix 658 rows 180 cols
[2025-05-31 10:26:10] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:26:10] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 658/826 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 88/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/838 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/838 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 838/838 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:26:11] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 3 ms to minimize.
[2025-05-31 10:26:11] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 658/826 variables, 168/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 88/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/838 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/838 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/838 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 838/838 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 666/666 transitions.
Applied a total of 0 rules in 11 ms. Remains 180 /180 variables (removed 0) and now considering 666/666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 180/180 places, 666/666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 666/666 transitions.
Applied a total of 0 rules in 11 ms. Remains 180 /180 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2025-05-31 10:26:11] [INFO ] Flow matrix only has 658 transitions (discarded 8 similar events)
[2025-05-31 10:26:11] [INFO ] Invariant cache hit.
[2025-05-31 10:26:11] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-05-31 10:26:11] [INFO ] Flow matrix only has 658 transitions (discarded 8 similar events)
[2025-05-31 10:26:12] [INFO ] Invariant cache hit.
[2025-05-31 10:26:12] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-31 10:26:13] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
[2025-05-31 10:26:13] [INFO ] Redundant transitions in 14 ms returned []
Running 658 sub problems to find dead transitions.
[2025-05-31 10:26:13] [INFO ] Flow matrix only has 658 transitions (discarded 8 similar events)
[2025-05-31 10:26:13] [INFO ] Invariant cache hit.
[2025-05-31 10:26:13] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2025-05-31 10:26:23] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2025-05-31 10:26:23] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 3 ms to minimize.
[2025-05-31 10:26:23] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2025-05-31 10:26:23] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2025-05-31 10:26:24] [INFO ] Deduced a trap composed of 97 places in 257 ms of which 3 ms to minimize.
[2025-05-31 10:26:24] [INFO ] Deduced a trap composed of 97 places in 255 ms of which 3 ms to minimize.
[2025-05-31 10:26:25] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2025-05-31 10:26:26] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 3 ms to minimize.
[2025-05-31 10:26:27] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 3 ms to minimize.
[2025-05-31 10:26:28] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 3 ms to minimize.
[2025-05-31 10:26:29] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2025-05-31 10:26:36] [INFO ] Deduced a trap composed of 54 places in 285 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/838 variables, and 22 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/180 constraints, ReadFeed: 0/88 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (OVERLAPS) 658/838 variables, 180/202 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 88/290 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 658/948 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/838 variables, and 948 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 12/12 constraints]
After SMT, in 61646ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 61658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63000 ms. Remains : 180/180 places, 666/666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 180 vertex of which 35 / 180 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 149 transition count 489
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 149 transition count 489
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 149 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 148 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 148 transition count 469
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 148 transition count 467
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 146 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 45 place count 146 transition count 454
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 51 place count 146 transition count 448
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 60 place count 140 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 67 place count 140 transition count 438
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 140 transition count 435
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 73 place count 137 transition count 435
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 78 place count 137 transition count 435
Applied a total of 78 rules in 64 ms. Remains 137 /180 variables (removed 43) and now considering 435/666 (removed 231) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:27:14] [INFO ] Flow matrix only has 431 transitions (discarded 4 similar events)
// Phase 1: matrix 431 rows 137 cols
[2025-05-31 10:27:14] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:27:14] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:27:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 10:27:15] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:27:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:27:15] [INFO ] After 54ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:27:15] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:27:15] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 547 ms.
RANDOM walk for 40000 steps (912 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (201 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 508518 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 508518 steps, saw 152025 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2025-05-31 10:27:18] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:27:18] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 10:27:18] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:27:19] [INFO ] Deduced a trap composed of 73 places in 320 ms of which 3 ms to minimize.
[2025-05-31 10:27:19] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 190 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 190 transition count 715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 189 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 189 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 706
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 706
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 704
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 704
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 697
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 695
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 688
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 688
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 679
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 677
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 677
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 671
Applied a total of 43 rules in 84 ms. Remains 179 /202 variables (removed 23) and now considering 671/726 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 179/202 places, 671/726 transitions.
RANDOM walk for 40000 steps (922 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 711267 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 1
Probabilistic random walk after 711267 steps, saw 160164 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
[2025-05-31 10:27:23] [INFO ] Flow matrix only has 663 transitions (discarded 8 similar events)
// Phase 1: matrix 663 rows 179 cols
[2025-05-31 10:27:23] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:27:23] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 663/830 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/830 variables, 89/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/830 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/842 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/842 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:27:23] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 3 ms to minimize.
[2025-05-31 10:27:23] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 2 ms to minimize.
[2025-05-31 10:27:23] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2025-05-31 10:27:24] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 3 ms to minimize.
[2025-05-31 10:27:24] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2025-05-31 10:27:24] [INFO ] Deduced a trap composed of 96 places in 261 ms of which 3 ms to minimize.
[2025-05-31 10:27:24] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 663/830 variables, 167/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/830 variables, 89/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/830 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/842 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/842 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2203ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 671/671 transitions.
Applied a total of 0 rules in 13 ms. Remains 179 /179 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 179/179 places, 671/671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 671/671 transitions.
Applied a total of 0 rules in 13 ms. Remains 179 /179 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2025-05-31 10:27:25] [INFO ] Flow matrix only has 663 transitions (discarded 8 similar events)
[2025-05-31 10:27:25] [INFO ] Invariant cache hit.
[2025-05-31 10:27:25] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-05-31 10:27:25] [INFO ] Flow matrix only has 663 transitions (discarded 8 similar events)
[2025-05-31 10:27:25] [INFO ] Invariant cache hit.
[2025-05-31 10:27:25] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-05-31 10:27:26] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
[2025-05-31 10:27:26] [INFO ] Redundant transitions in 16 ms returned []
Running 663 sub problems to find dead transitions.
[2025-05-31 10:27:26] [INFO ] Flow matrix only has 663 transitions (discarded 8 similar events)
[2025-05-31 10:27:26] [INFO ] Invariant cache hit.
[2025-05-31 10:27:26] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2025-05-31 10:27:36] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2025-05-31 10:27:37] [INFO ] Deduced a trap composed of 62 places in 300 ms of which 3 ms to minimize.
[2025-05-31 10:27:37] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 3 ms to minimize.
[2025-05-31 10:27:37] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 3 ms to minimize.
[2025-05-31 10:27:37] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-05-31 10:27:38] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2025-05-31 10:27:38] [INFO ] Deduced a trap composed of 96 places in 238 ms of which 3 ms to minimize.
[2025-05-31 10:27:38] [INFO ] Deduced a trap composed of 133 places in 276 ms of which 3 ms to minimize.
[2025-05-31 10:27:39] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2025-05-31 10:27:40] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 3 ms to minimize.
[2025-05-31 10:27:42] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 3 ms to minimize.
[2025-05-31 10:27:43] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 3 ms to minimize.
[2025-05-31 10:27:45] [INFO ] Deduced a trap composed of 96 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2025-05-31 10:27:50] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/842 variables, and 24 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/179 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 4 (OVERLAPS) 663/842 variables, 179/203 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/842 variables, 89/292 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 663/955 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 842/842 variables, and 955 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 14/14 constraints]
After SMT, in 61725ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 61738ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63139 ms. Remains : 179/179 places, 671/671 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 179 vertex of which 35 / 179 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 148 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 148 transition count 494
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 148 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 147 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 147 transition count 473
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 147 transition count 471
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 145 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 51 place count 145 transition count 453
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 145 transition count 447
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 66 place count 139 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 73 place count 139 transition count 437
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 139 transition count 434
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 79 place count 136 transition count 434
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 84 place count 136 transition count 434
Applied a total of 84 rules in 57 ms. Remains 136 /179 variables (removed 43) and now considering 434/671 (removed 237) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:28:28] [INFO ] Flow matrix only has 430 transitions (discarded 4 similar events)
// Phase 1: matrix 430 rows 136 cols
[2025-05-31 10:28:28] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:28:28] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:28:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 10:28:28] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:28:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:28:28] [INFO ] After 41ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:28:28] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:28:29] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 493 ms.
RANDOM walk for 40000 steps (897 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (196 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 547410 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 547410 steps, saw 163306 distinct states, run finished after 3003 ms. (steps per millisecond=182 ) properties seen :0
[2025-05-31 10:28:32] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:28:32] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:28:32] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:28:32] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 699
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 657
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 657
Applied a total of 45 rules in 54 ms. Remains 178 /202 variables (removed 24) and now considering 657/726 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 178/202 places, 657/726 transitions.
RANDOM walk for 40000 steps (901 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (178 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 784038 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 1
Probabilistic random walk after 784038 steps, saw 173809 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
[2025-05-31 10:28:36] [INFO ] Flow matrix only has 649 transitions (discarded 8 similar events)
// Phase 1: matrix 649 rows 178 cols
[2025-05-31 10:28:36] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:28:36] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 649/815 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 87/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/827 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/827 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 827/827 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:28:36] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 3 ms to minimize.
[2025-05-31 10:28:36] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 649/815 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 87/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/815 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/815 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/827 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/827 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/827 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 827/827 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1254ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 657/657 transitions.
Applied a total of 0 rules in 12 ms. Remains 178 /178 variables (removed 0) and now considering 657/657 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 178/178 places, 657/657 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 657/657 transitions.
Applied a total of 0 rules in 12 ms. Remains 178 /178 variables (removed 0) and now considering 657/657 (removed 0) transitions.
[2025-05-31 10:28:37] [INFO ] Flow matrix only has 649 transitions (discarded 8 similar events)
[2025-05-31 10:28:37] [INFO ] Invariant cache hit.
[2025-05-31 10:28:37] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-05-31 10:28:37] [INFO ] Flow matrix only has 649 transitions (discarded 8 similar events)
[2025-05-31 10:28:37] [INFO ] Invariant cache hit.
[2025-05-31 10:28:38] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 10:28:38] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2025-05-31 10:28:38] [INFO ] Redundant transitions in 15 ms returned []
Running 649 sub problems to find dead transitions.
[2025-05-31 10:28:38] [INFO ] Flow matrix only has 649 transitions (discarded 8 similar events)
[2025-05-31 10:28:38] [INFO ] Invariant cache hit.
[2025-05-31 10:28:38] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2025-05-31 10:28:49] [INFO ] Deduced a trap composed of 59 places in 288 ms of which 3 ms to minimize.
[2025-05-31 10:28:49] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 3 ms to minimize.
[2025-05-31 10:28:49] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2025-05-31 10:28:50] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-05-31 10:28:50] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2025-05-31 10:28:50] [INFO ] Deduced a trap composed of 96 places in 268 ms of which 4 ms to minimize.
[2025-05-31 10:28:51] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2025-05-31 10:28:52] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 3 ms to minimize.
[2025-05-31 10:28:53] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 3 ms to minimize.
[2025-05-31 10:28:54] [INFO ] Deduced a trap composed of 36 places in 286 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (OVERLAPS) 649/827 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 87/285 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 827/827 variables, and 285 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (OVERLAPS) 649/827 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 87/285 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 649/934 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 827/827 variables, and 934 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 10/10 constraints]
After SMT, in 61465ms problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 61478ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62882 ms. Remains : 178/178 places, 657/657 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 178 vertex of which 35 / 178 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 147 transition count 480
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 147 transition count 480
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 147 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 146 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 146 transition count 460
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 146 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 144 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 144 transition count 446
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 144 transition count 440
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 138 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 138 transition count 430
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 138 transition count 427
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 135 transition count 427
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 135 transition count 427
Applied a total of 77 rules in 42 ms. Remains 135 /178 variables (removed 43) and now considering 427/657 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:29:40] [INFO ] Flow matrix only has 423 transitions (discarded 4 similar events)
// Phase 1: matrix 423 rows 135 cols
[2025-05-31 10:29:40] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:29:40] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:29:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 10:29:40] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:29:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:29:40] [INFO ] After 27ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:29:40] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
[2025-05-31 10:29:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
TRAPS : Iteration 1
[2025-05-31 10:29:40] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:29:40] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 485 ms.
RANDOM walk for 40000 steps (916 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (192 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 582472 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 582472 steps, saw 173444 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2025-05-31 10:29:43] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:29:43] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:29:44] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:29:44] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 2 ms to minimize.
[2025-05-31 10:29:44] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1098ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 697
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 688
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 688
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 679
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 670
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 657
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 657
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 655
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 655
Applied a total of 47 rules in 67 ms. Remains 177 /202 variables (removed 25) and now considering 655/726 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 177/202 places, 655/726 transitions.
RANDOM walk for 40000 steps (889 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (198 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 802896 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 802896 steps, saw 177097 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
[2025-05-31 10:29:48] [INFO ] Flow matrix only has 647 transitions (discarded 8 similar events)
// Phase 1: matrix 647 rows 177 cols
[2025-05-31 10:29:48] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:29:48] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 647/812 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 87/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/812 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/824 variables, 12/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/824 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:29:48] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 3 ms to minimize.
[2025-05-31 10:29:48] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2025-05-31 10:29:49] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 647/812 variables, 165/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/812 variables, 87/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/812 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/812 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/824 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/824 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/824 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 824/824 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1361ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 655/655 transitions.
Applied a total of 0 rules in 11 ms. Remains 177 /177 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 177/177 places, 655/655 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 655/655 transitions.
Applied a total of 0 rules in 11 ms. Remains 177 /177 variables (removed 0) and now considering 655/655 (removed 0) transitions.
[2025-05-31 10:29:49] [INFO ] Flow matrix only has 647 transitions (discarded 8 similar events)
[2025-05-31 10:29:49] [INFO ] Invariant cache hit.
[2025-05-31 10:29:50] [INFO ] Implicit Places using invariants in 331 ms returned []
[2025-05-31 10:29:50] [INFO ] Flow matrix only has 647 transitions (discarded 8 similar events)
[2025-05-31 10:29:50] [INFO ] Invariant cache hit.
[2025-05-31 10:29:50] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 10:29:51] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2025-05-31 10:29:51] [INFO ] Redundant transitions in 14 ms returned []
Running 647 sub problems to find dead transitions.
[2025-05-31 10:29:51] [INFO ] Flow matrix only has 647 transitions (discarded 8 similar events)
[2025-05-31 10:29:51] [INFO ] Invariant cache hit.
[2025-05-31 10:29:51] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 647 unsolved
[2025-05-31 10:30:01] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 3 ms to minimize.
[2025-05-31 10:30:01] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 3 ms to minimize.
[2025-05-31 10:30:01] [INFO ] Deduced a trap composed of 36 places in 286 ms of which 3 ms to minimize.
[2025-05-31 10:30:02] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 3 ms to minimize.
[2025-05-31 10:30:02] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2025-05-31 10:30:02] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2025-05-31 10:30:02] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2025-05-31 10:30:02] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 3 ms to minimize.
[2025-05-31 10:30:03] [INFO ] Deduced a trap composed of 95 places in 249 ms of which 3 ms to minimize.
[2025-05-31 10:30:03] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2025-05-31 10:30:04] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 3 ms to minimize.
[2025-05-31 10:30:06] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 3 ms to minimize.
[2025-05-31 10:30:07] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 4 (OVERLAPS) 647/824 variables, 177/200 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 87/287 constraints. Problems are: Problem set: 0 solved, 647 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 824/824 variables, and 287 constraints, problems are : Problem set: 0 solved, 647 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 647/647 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 647 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 4 (OVERLAPS) 647/824 variables, 177/200 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 87/287 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 647/934 constraints. Problems are: Problem set: 0 solved, 647 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/824 variables, and 934 constraints, problems are : Problem set: 0 solved, 647 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 647/647 constraints, Known Traps: 13/13 constraints]
After SMT, in 61594ms problems are : Problem set: 0 solved, 647 unsolved
Search for dead transitions found 0 dead transitions in 61605ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63022 ms. Remains : 177/177 places, 655/655 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 177 vertex of which 35 / 177 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 146 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 146 transition count 478
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 145 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 145 transition count 458
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 145 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 143 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 143 transition count 444
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 143 transition count 438
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 137 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 137 transition count 428
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 137 transition count 425
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 134 transition count 425
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 134 transition count 425
Applied a total of 77 rules in 64 ms. Remains 134 /177 variables (removed 43) and now considering 425/655 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:30:52] [INFO ] Flow matrix only has 421 transitions (discarded 4 similar events)
// Phase 1: matrix 421 rows 134 cols
[2025-05-31 10:30:52] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:30:52] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:30:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 10:30:53] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:30:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:30:53] [INFO ] After 38ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:30:53] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:30:53] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 518 ms.
RANDOM walk for 40000 steps (904 resets) in 336 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (195 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 520559 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 520559 steps, saw 155264 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2025-05-31 10:30:56] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:30:56] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:30:56] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 839ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 697
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 697
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 683
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 656
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 654
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 648
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 648
Applied a total of 49 rules in 85 ms. Remains 176 /202 variables (removed 26) and now considering 648/726 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 176/202 places, 648/726 transitions.
RANDOM walk for 40000 steps (907 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (188 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 665201 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :0 out of 1
Probabilistic random walk after 665201 steps, saw 149411 distinct states, run finished after 3006 ms. (steps per millisecond=221 ) properties seen :0
[2025-05-31 10:31:00] [INFO ] Flow matrix only has 640 transitions (discarded 8 similar events)
// Phase 1: matrix 640 rows 176 cols
[2025-05-31 10:31:00] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:31:00] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 640/804 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 86/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/816 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/816 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:31:01] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2025-05-31 10:31:01] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 3 ms to minimize.
[2025-05-31 10:31:01] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 640/804 variables, 164/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 86/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/816 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/816 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/816 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 648/648 transitions.
Applied a total of 0 rules in 11 ms. Remains 176 /176 variables (removed 0) and now considering 648/648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 176/176 places, 648/648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 648/648 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2025-05-31 10:31:01] [INFO ] Flow matrix only has 640 transitions (discarded 8 similar events)
[2025-05-31 10:31:01] [INFO ] Invariant cache hit.
[2025-05-31 10:31:02] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-05-31 10:31:02] [INFO ] Flow matrix only has 640 transitions (discarded 8 similar events)
[2025-05-31 10:31:02] [INFO ] Invariant cache hit.
[2025-05-31 10:31:02] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-31 10:31:03] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
[2025-05-31 10:31:03] [INFO ] Redundant transitions in 9 ms returned []
Running 640 sub problems to find dead transitions.
[2025-05-31 10:31:03] [INFO ] Flow matrix only has 640 transitions (discarded 8 similar events)
[2025-05-31 10:31:03] [INFO ] Invariant cache hit.
[2025-05-31 10:31:03] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 640 unsolved
[2025-05-31 10:31:12] [INFO ] Deduced a trap composed of 58 places in 297 ms of which 3 ms to minimize.
[2025-05-31 10:31:12] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 3 ms to minimize.
[2025-05-31 10:31:13] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 3 ms to minimize.
[2025-05-31 10:31:13] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2025-05-31 10:31:13] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2025-05-31 10:31:13] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2025-05-31 10:31:13] [INFO ] Deduced a trap composed of 95 places in 270 ms of which 3 ms to minimize.
[2025-05-31 10:31:14] [INFO ] Deduced a trap composed of 95 places in 313 ms of which 4 ms to minimize.
[2025-05-31 10:31:14] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2025-05-31 10:31:15] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 3 ms to minimize.
[2025-05-31 10:31:17] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 3 ms to minimize.
[2025-05-31 10:31:18] [INFO ] Deduced a trap composed of 49 places in 412 ms of which 4 ms to minimize.
[2025-05-31 10:31:19] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 4 (OVERLAPS) 640/816 variables, 176/199 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 86/285 constraints. Problems are: Problem set: 0 solved, 640 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/816 variables, and 285 constraints, problems are : Problem set: 0 solved, 640 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 640/640 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 4 (OVERLAPS) 640/816 variables, 176/199 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 86/285 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 640/925 constraints. Problems are: Problem set: 0 solved, 640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/816 variables, and 925 constraints, problems are : Problem set: 0 solved, 640 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 640/640 constraints, Known Traps: 13/13 constraints]
After SMT, in 61263ms problems are : Problem set: 0 solved, 640 unsolved
Search for dead transitions found 0 dead transitions in 61271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62546 ms. Remains : 176/176 places, 648/648 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 105 edges and 176 vertex of which 35 / 176 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 145 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 145 transition count 471
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 145 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 144 transition count 463
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 144 transition count 451
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 144 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 142 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 142 transition count 437
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 142 transition count 431
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 136 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 136 transition count 421
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 136 transition count 418
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 133 transition count 418
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 133 transition count 418
Applied a total of 77 rules in 63 ms. Remains 133 /176 variables (removed 43) and now considering 418/648 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:32:04] [INFO ] Flow matrix only has 414 transitions (discarded 4 similar events)
// Phase 1: matrix 414 rows 133 cols
[2025-05-31 10:32:04] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:32:04] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:32:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 10:32:04] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:32:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:32:04] [INFO ] After 52ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:32:04] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:32:04] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 531 ms.
RANDOM walk for 40000 steps (918 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (181 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 555022 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 555022 steps, saw 165029 distinct states, run finished after 3004 ms. (steps per millisecond=184 ) properties seen :0
[2025-05-31 10:32:08] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:32:08] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:32:08] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:32:08] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 3 ms to minimize.
[2025-05-31 10:32:08] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 4 ms to minimize.
[2025-05-31 10:32:09] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2025-05-31 10:32:09] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1505ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 697
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 697
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 683
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 679
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 670
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 654
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 648
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 648
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 175 transition count 646
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 175 transition count 646
Applied a total of 51 rules in 54 ms. Remains 175 /202 variables (removed 27) and now considering 646/726 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 175/202 places, 646/726 transitions.
RANDOM walk for 40000 steps (909 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (189 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 836854 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 836854 steps, saw 183728 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2025-05-31 10:32:12] [INFO ] Flow matrix only has 638 transitions (discarded 8 similar events)
// Phase 1: matrix 638 rows 175 cols
[2025-05-31 10:32:12] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:32:12] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 638/801 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 86/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/813 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/813 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/813 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:32:13] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 3 ms to minimize.
[2025-05-31 10:32:13] [INFO ] Deduced a trap composed of 16 places in 274 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 638/801 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 86/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/801 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/813 variables, 12/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/813 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/813 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1547ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 646/646 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 646/646 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 175/175 places, 646/646 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 646/646 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 646/646 (removed 0) transitions.
[2025-05-31 10:32:14] [INFO ] Flow matrix only has 638 transitions (discarded 8 similar events)
[2025-05-31 10:32:14] [INFO ] Invariant cache hit.
[2025-05-31 10:32:14] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-05-31 10:32:14] [INFO ] Flow matrix only has 638 transitions (discarded 8 similar events)
[2025-05-31 10:32:14] [INFO ] Invariant cache hit.
[2025-05-31 10:32:15] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-31 10:32:15] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2025-05-31 10:32:15] [INFO ] Redundant transitions in 14 ms returned []
Running 638 sub problems to find dead transitions.
[2025-05-31 10:32:15] [INFO ] Flow matrix only has 638 transitions (discarded 8 similar events)
[2025-05-31 10:32:15] [INFO ] Invariant cache hit.
[2025-05-31 10:32:15] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2025-05-31 10:32:26] [INFO ] Deduced a trap composed of 60 places in 294 ms of which 3 ms to minimize.
[2025-05-31 10:32:26] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 3 ms to minimize.
[2025-05-31 10:32:26] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 4 ms to minimize.
[2025-05-31 10:32:26] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2025-05-31 10:32:26] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2025-05-31 10:32:27] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2025-05-31 10:32:27] [INFO ] Deduced a trap composed of 122 places in 250 ms of which 3 ms to minimize.
[2025-05-31 10:32:27] [INFO ] Deduced a trap composed of 129 places in 252 ms of which 3 ms to minimize.
[2025-05-31 10:32:28] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 4 ms to minimize.
[2025-05-31 10:32:30] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 3 ms to minimize.
[2025-05-31 10:32:30] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2025-05-31 10:32:31] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 3 ms to minimize.
[2025-05-31 10:32:31] [INFO ] Deduced a trap composed of 94 places in 263 ms of which 3 ms to minimize.
[2025-05-31 10:32:32] [INFO ] Deduced a trap composed of 94 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 4 (OVERLAPS) 638/813 variables, 175/199 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 86/285 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 813/813 variables, and 285 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 638/638 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 4 (OVERLAPS) 638/813 variables, 175/199 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 86/285 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 638/923 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 813/813 variables, and 923 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 638/638 constraints, Known Traps: 14/14 constraints]
After SMT, in 61686ms problems are : Problem set: 0 solved, 638 unsolved
Search for dead transitions found 0 dead transitions in 61697ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63017 ms. Remains : 175/175 places, 646/646 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 105 edges and 175 vertex of which 35 / 175 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 144 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 144 transition count 469
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 143 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 143 transition count 449
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 143 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 141 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 141 transition count 435
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 141 transition count 429
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 135 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 135 transition count 419
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 135 transition count 416
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 132 transition count 416
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 132 transition count 416
Applied a total of 77 rules in 60 ms. Remains 132 /175 variables (removed 43) and now considering 416/646 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:33:17] [INFO ] Flow matrix only has 412 transitions (discarded 4 similar events)
// Phase 1: matrix 412 rows 132 cols
[2025-05-31 10:33:17] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:33:17] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:33:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 10:33:17] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:33:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:33:17] [INFO ] After 19ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:33:17] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:33:17] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 370 ms.
RANDOM walk for 40000 steps (906 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (183 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 569266 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569266 steps, saw 169126 distinct states, run finished after 3003 ms. (steps per millisecond=189 ) properties seen :0
[2025-05-31 10:33:20] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:33:20] [INFO ] Computed 10 invariants in 9 ms
[2025-05-31 10:33:20] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:33:21] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1126ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 697
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 697
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 683
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 679
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 679
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 181 transition count 665
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 181 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 656
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 654
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 647
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 647
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 645
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 645
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 175 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 175 transition count 641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 174 transition count 639
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 174 transition count 639
Applied a total of 53 rules in 82 ms. Remains 174 /202 variables (removed 28) and now considering 639/726 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 174/202 places, 639/726 transitions.
RANDOM walk for 40000 steps (895 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (191 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732785 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 732785 steps, saw 164231 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
[2025-05-31 10:33:25] [INFO ] Flow matrix only has 631 transitions (discarded 8 similar events)
// Phase 1: matrix 631 rows 174 cols
[2025-05-31 10:33:25] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:33:25] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 631/793 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 85/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/805 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/805 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:33:25] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 631/793 variables, 162/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 85/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/793 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/805 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/805 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/805 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 892ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 639/639 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 639/639 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 174/174 places, 639/639 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 639/639 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 639/639 (removed 0) transitions.
[2025-05-31 10:33:26] [INFO ] Flow matrix only has 631 transitions (discarded 8 similar events)
[2025-05-31 10:33:26] [INFO ] Invariant cache hit.
[2025-05-31 10:33:26] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-05-31 10:33:26] [INFO ] Flow matrix only has 631 transitions (discarded 8 similar events)
[2025-05-31 10:33:26] [INFO ] Invariant cache hit.
[2025-05-31 10:33:26] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-31 10:33:27] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
[2025-05-31 10:33:27] [INFO ] Redundant transitions in 14 ms returned []
Running 631 sub problems to find dead transitions.
[2025-05-31 10:33:27] [INFO ] Flow matrix only has 631 transitions (discarded 8 similar events)
[2025-05-31 10:33:27] [INFO ] Invariant cache hit.
[2025-05-31 10:33:27] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2025-05-31 10:33:37] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 2 ms to minimize.
[2025-05-31 10:33:37] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2025-05-31 10:33:38] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2025-05-31 10:33:38] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2025-05-31 10:33:38] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2025-05-31 10:33:38] [INFO ] Deduced a trap composed of 122 places in 198 ms of which 2 ms to minimize.
[2025-05-31 10:33:38] [INFO ] Deduced a trap composed of 94 places in 250 ms of which 3 ms to minimize.
[2025-05-31 10:33:39] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2025-05-31 10:33:40] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 4 ms to minimize.
[2025-05-31 10:33:42] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 4 ms to minimize.
[2025-05-31 10:33:43] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 2 ms to minimize.
[2025-05-31 10:33:43] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 2 ms to minimize.
[2025-05-31 10:33:43] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2025-05-31 10:33:46] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 631 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/805 variables, and 24 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/174 constraints, ReadFeed: 0/85 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 631/805 variables, 174/198 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 85/283 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 631/914 constraints. Problems are: Problem set: 0 solved, 631 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 914 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 14/14 constraints]
After SMT, in 61491ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 61502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62868 ms. Remains : 174/174 places, 639/639 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 104 edges and 174 vertex of which 35 / 174 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 143 transition count 462
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 143 transition count 462
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 143 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 142 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 142 transition count 442
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 142 transition count 440
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 140 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 140 transition count 428
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 140 transition count 422
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 134 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 134 transition count 412
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 134 transition count 409
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 131 transition count 409
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 131 transition count 409
Applied a total of 77 rules in 62 ms. Remains 131 /174 variables (removed 43) and now considering 409/639 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:34:29] [INFO ] Flow matrix only has 405 transitions (discarded 4 similar events)
// Phase 1: matrix 405 rows 131 cols
[2025-05-31 10:34:29] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:34:29] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:34:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 10:34:29] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:34:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:34:29] [INFO ] After 56ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:34:29] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:34:29] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 531 ms.
RANDOM walk for 40000 steps (901 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (172 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559907 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559907 steps, saw 165929 distinct states, run finished after 3004 ms. (steps per millisecond=186 ) properties seen :0
[2025-05-31 10:34:32] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:34:32] [INFO ] Computed 10 invariants in 9 ms
[2025-05-31 10:34:32] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:34:33] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2025-05-31 10:34:33] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 2 ms to minimize.
[2025-05-31 10:34:33] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2025-05-31 10:34:33] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1255ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 697
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 697
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 683
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 679
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 679
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 181 transition count 665
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 181 transition count 665
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 179 transition count 661
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 654
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 645
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 645
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 175 transition count 643
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 175 transition count 643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 174 transition count 639
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 174 transition count 639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 173 transition count 637
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 173 transition count 637
Applied a total of 55 rules in 60 ms. Remains 173 /202 variables (removed 29) and now considering 637/726 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 173/202 places, 637/726 transitions.
RANDOM walk for 40000 steps (916 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (182 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 800699 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 800699 steps, saw 176513 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2025-05-31 10:34:37] [INFO ] Flow matrix only has 629 transitions (discarded 8 similar events)
// Phase 1: matrix 629 rows 173 cols
[2025-05-31 10:34:37] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:34:37] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 629/790 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 85/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/802 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/802 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/802 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:34:37] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/790 variables, 161/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 85/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/790 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:34:38] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/790 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/802 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/802 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1187ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 637/637 transitions.
Applied a total of 0 rules in 10 ms. Remains 173 /173 variables (removed 0) and now considering 637/637 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 173/173 places, 637/637 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 637/637 transitions.
Applied a total of 0 rules in 10 ms. Remains 173 /173 variables (removed 0) and now considering 637/637 (removed 0) transitions.
[2025-05-31 10:34:38] [INFO ] Flow matrix only has 629 transitions (discarded 8 similar events)
[2025-05-31 10:34:38] [INFO ] Invariant cache hit.
[2025-05-31 10:34:38] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-05-31 10:34:38] [INFO ] Flow matrix only has 629 transitions (discarded 8 similar events)
[2025-05-31 10:34:38] [INFO ] Invariant cache hit.
[2025-05-31 10:34:38] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-31 10:34:39] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
[2025-05-31 10:34:39] [INFO ] Redundant transitions in 14 ms returned []
Running 629 sub problems to find dead transitions.
[2025-05-31 10:34:39] [INFO ] Flow matrix only has 629 transitions (discarded 8 similar events)
[2025-05-31 10:34:39] [INFO ] Invariant cache hit.
[2025-05-31 10:34:39] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2025-05-31 10:34:49] [INFO ] Deduced a trap composed of 56 places in 299 ms of which 3 ms to minimize.
[2025-05-31 10:34:49] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2025-05-31 10:34:49] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 3 ms to minimize.
[2025-05-31 10:34:50] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 3 ms to minimize.
[2025-05-31 10:34:50] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2025-05-31 10:34:50] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2025-05-31 10:34:50] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2025-05-31 10:34:51] [INFO ] Deduced a trap composed of 93 places in 248 ms of which 3 ms to minimize.
[2025-05-31 10:34:51] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2025-05-31 10:34:52] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 3 ms to minimize.
[2025-05-31 10:34:54] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 629/802 variables, 173/194 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 85/279 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/802 variables, and 279 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 629/802 variables, 173/194 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 85/279 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 629/908 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/802 variables, and 908 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 11/11 constraints]
After SMT, in 61474ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 61486ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62780 ms. Remains : 173/173 places, 637/637 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 104 edges and 173 vertex of which 35 / 173 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 142 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 142 transition count 460
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 141 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 141 transition count 440
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 141 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 139 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 139 transition count 426
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 139 transition count 420
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 133 transition count 417
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 133 transition count 410
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 133 transition count 407
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 130 transition count 407
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 130 transition count 407
Applied a total of 77 rules in 49 ms. Remains 130 /173 variables (removed 43) and now considering 407/637 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:35:41] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 130 cols
[2025-05-31 10:35:41] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 10:35:41] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:35:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 10:35:41] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:35:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:35:41] [INFO ] After 29ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:35:41] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:35:41] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 408 ms.
RANDOM walk for 40000 steps (906 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (171 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 523991 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523991 steps, saw 156056 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2025-05-31 10:35:44] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:35:44] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:35:44] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:35:45] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 777ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 697
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 697
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 683
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 679
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 679
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 181 transition count 665
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 181 transition count 665
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 179 transition count 661
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 179 transition count 661
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 177 transition count 647
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 177 transition count 647
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 645
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 645
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 175 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 175 transition count 638
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 174 transition count 636
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 174 transition count 636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 173 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 173 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 172 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 172 transition count 630
Applied a total of 57 rules in 48 ms. Remains 172 /202 variables (removed 30) and now considering 630/726 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 172/202 places, 630/726 transitions.
RANDOM walk for 40000 steps (899 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (186 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 761622 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 1
Probabilistic random walk after 761622 steps, saw 169413 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
[2025-05-31 10:35:48] [INFO ] Flow matrix only has 622 transitions (discarded 8 similar events)
// Phase 1: matrix 622 rows 172 cols
[2025-05-31 10:35:48] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:35:48] [INFO ] State equation strengthened by 84 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 622/782 variables, 160/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 84/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/794 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/794 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/794 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:35:49] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2025-05-31 10:35:49] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 3 ms to minimize.
[2025-05-31 10:35:49] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 3 ms to minimize.
[2025-05-31 10:35:49] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 622/782 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 84/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/794 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/794 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/794 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 630/630 transitions.
Applied a total of 0 rules in 11 ms. Remains 172 /172 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 172/172 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 630/630 transitions.
Applied a total of 0 rules in 10 ms. Remains 172 /172 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2025-05-31 10:35:50] [INFO ] Flow matrix only has 622 transitions (discarded 8 similar events)
[2025-05-31 10:35:50] [INFO ] Invariant cache hit.
[2025-05-31 10:35:50] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-05-31 10:35:50] [INFO ] Flow matrix only has 622 transitions (discarded 8 similar events)
[2025-05-31 10:35:50] [INFO ] Invariant cache hit.
[2025-05-31 10:35:50] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-05-31 10:35:51] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2025-05-31 10:35:51] [INFO ] Redundant transitions in 14 ms returned []
Running 622 sub problems to find dead transitions.
[2025-05-31 10:35:51] [INFO ] Flow matrix only has 622 transitions (discarded 8 similar events)
[2025-05-31 10:35:51] [INFO ] Invariant cache hit.
[2025-05-31 10:35:51] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2025-05-31 10:36:00] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 3 ms to minimize.
[2025-05-31 10:36:01] [INFO ] Deduced a trap composed of 56 places in 267 ms of which 2 ms to minimize.
[2025-05-31 10:36:01] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 3 ms to minimize.
[2025-05-31 10:36:01] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2025-05-31 10:36:01] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2025-05-31 10:36:01] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2025-05-31 10:36:02] [INFO ] Deduced a trap composed of 93 places in 221 ms of which 3 ms to minimize.
[2025-05-31 10:36:02] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2025-05-31 10:36:03] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 3 ms to minimize.
[2025-05-31 10:36:05] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 3 ms to minimize.
[2025-05-31 10:36:06] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 2 ms to minimize.
[2025-05-31 10:36:06] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 2 ms to minimize.
[2025-05-31 10:36:07] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 4 (OVERLAPS) 622/794 variables, 172/195 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 84/279 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 279 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2025-05-31 10:36:30] [INFO ] Deduced a trap composed of 38 places in 297 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 5 (OVERLAPS) 622/794 variables, 172/196 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 84/280 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 622/902 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 902 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 14/14 constraints]
After SMT, in 61565ms problems are : Problem set: 0 solved, 622 unsolved
Search for dead transitions found 0 dead transitions in 61576ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62847 ms. Remains : 172/172 places, 630/630 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 103 edges and 172 vertex of which 35 / 172 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 141 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 141 transition count 453
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 141 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 140 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 140 transition count 433
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 140 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 138 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 138 transition count 419
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 138 transition count 413
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 132 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 132 transition count 403
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 132 transition count 400
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 129 transition count 400
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 129 transition count 400
Applied a total of 77 rules in 33 ms. Remains 129 /172 variables (removed 43) and now considering 400/630 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:36:53] [INFO ] Flow matrix only has 396 transitions (discarded 4 similar events)
// Phase 1: matrix 396 rows 129 cols
[2025-05-31 10:36:53] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 10:36:53] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:36:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-31 10:36:53] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:36:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:36:53] [INFO ] After 42ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:36:53] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:36:53] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
RANDOM walk for 40000 steps (900 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (187 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540955 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540955 steps, saw 161552 distinct states, run finished after 3005 ms. (steps per millisecond=180 ) properties seen :0
[2025-05-31 10:36:56] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:36:56] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:36:56] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 718/905 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 93/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/920 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:36:56] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 2 ms to minimize.
[2025-05-31 10:36:57] [INFO ] Deduced a trap composed of 73 places in 280 ms of which 3 ms to minimize.
[2025-05-31 10:36:57] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2025-05-31 10:36:57] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 718/905 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 93/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/905 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/920 variables, 15/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/920 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1636ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 701
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 697
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 697
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 683
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 679
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 679
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 181 transition count 665
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 181 transition count 665
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 179 transition count 661
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 179 transition count 661
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 177 transition count 647
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 177 transition count 647
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 175 transition count 643
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 175 transition count 643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 174 transition count 636
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 174 transition count 636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 173 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 173 transition count 634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 172 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 172 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 171 transition count 628
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 171 transition count 628
Applied a total of 59 rules in 83 ms. Remains 171 /202 variables (removed 31) and now considering 628/726 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 171/202 places, 628/726 transitions.
RANDOM walk for 40000 steps (894 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (185 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 769354 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 1
Probabilistic random walk after 769354 steps, saw 171023 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
[2025-05-31 10:37:01] [INFO ] Flow matrix only has 620 transitions (discarded 8 similar events)
// Phase 1: matrix 620 rows 171 cols
[2025-05-31 10:37:01] [INFO ] Computed 10 invariants in 7 ms
[2025-05-31 10:37:01] [INFO ] State equation strengthened by 84 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 620/779 variables, 159/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 84/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/791 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/791 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 791/791 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:37:01] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2025-05-31 10:37:01] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 620/779 variables, 159/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 84/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/779 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/791 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/791 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/791 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 791/791 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 628/628 transitions.
Applied a total of 0 rules in 11 ms. Remains 171 /171 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 171/171 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 628/628 transitions.
Applied a total of 0 rules in 11 ms. Remains 171 /171 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2025-05-31 10:37:02] [INFO ] Flow matrix only has 620 transitions (discarded 8 similar events)
[2025-05-31 10:37:02] [INFO ] Invariant cache hit.
[2025-05-31 10:37:02] [INFO ] Implicit Places using invariants in 293 ms returned []
[2025-05-31 10:37:02] [INFO ] Flow matrix only has 620 transitions (discarded 8 similar events)
[2025-05-31 10:37:02] [INFO ] Invariant cache hit.
[2025-05-31 10:37:02] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-05-31 10:37:03] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2025-05-31 10:37:03] [INFO ] Redundant transitions in 13 ms returned []
Running 620 sub problems to find dead transitions.
[2025-05-31 10:37:03] [INFO ] Flow matrix only has 620 transitions (discarded 8 similar events)
[2025-05-31 10:37:03] [INFO ] Invariant cache hit.
[2025-05-31 10:37:03] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 620 unsolved
[2025-05-31 10:37:13] [INFO ] Deduced a trap composed of 56 places in 288 ms of which 3 ms to minimize.
[2025-05-31 10:37:14] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 2 ms to minimize.
[2025-05-31 10:37:14] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2025-05-31 10:37:14] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2025-05-31 10:37:14] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2025-05-31 10:37:14] [INFO ] Deduced a trap composed of 92 places in 202 ms of which 3 ms to minimize.
[2025-05-31 10:37:15] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2025-05-31 10:37:16] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 3 ms to minimize.
[2025-05-31 10:37:17] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 3 ms to minimize.
[2025-05-31 10:37:18] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 3 ms to minimize.
[2025-05-31 10:37:19] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 620 unsolved
[2025-05-31 10:37:24] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 620 unsolved
[2025-05-31 10:37:30] [INFO ] Deduced a trap composed of 55 places in 296 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/791 variables, and 23 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/171 constraints, ReadFeed: 0/84 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 620/791 variables, 171/194 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/791 variables, 84/278 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/791 variables, 620/898 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/791 variables, and 898 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 13/13 constraints]
After SMT, in 61898ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 61909ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63201 ms. Remains : 171/171 places, 628/628 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 103 edges and 171 vertex of which 35 / 171 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 140 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 140 transition count 451
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 140 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 139 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 139 transition count 431
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 139 transition count 429
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 137 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 137 transition count 417
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 137 transition count 411
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 59 place count 131 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 131 transition count 401
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 131 transition count 398
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 128 transition count 398
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 128 transition count 398
Applied a total of 77 rules in 62 ms. Remains 128 /171 variables (removed 43) and now considering 398/628 (removed 230) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:38:05] [INFO ] Flow matrix only has 394 transitions (discarded 4 similar events)
// Phase 1: matrix 394 rows 128 cols
[2025-05-31 10:38:05] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 10:38:05] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:38:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 10:38:05] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:38:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 10:38:06] [INFO ] After 47ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:38:06] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:38:06] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 498 ms.
RANDOM walk for 40000 steps (900 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 520601 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 520601 steps, saw 155278 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2025-05-31 10:38:09] [INFO ] Flow matrix only has 718 transitions (discarded 8 similar events)
// Phase 1: matrix 718 rows 202 cols
[2025-05-31 10:38:09] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 10:38:09] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 182/212 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 704/916 variables, 193/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/916 variables, 93/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/920 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/920 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 182/212 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:38:09] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 704/916 variables, 193/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 93/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:38:10] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 2 ms to minimize.
[2025-05-31 10:38:10] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/916 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/920 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/920 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1409ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 726/726 transitions.
Graph (complete) has 1143 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 201 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 199 transition count 724
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 197 transition count 722
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 195 transition count 720
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 195 transition count 720
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 193 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 191 transition count 702
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 191 transition count 702
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 189 transition count 698
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 189 transition count 698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 187 transition count 684
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 187 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 185 transition count 680
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 185 transition count 680
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 183 transition count 666
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 183 transition count 666
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 181 transition count 662
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 181 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 179 transition count 648
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 179 transition count 648
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 177 transition count 644
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 177 transition count 644
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 175 transition count 630
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 175 transition count 630
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 173 transition count 626
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 173 transition count 626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 171 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 171 transition count 618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 169 transition count 614
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 169 transition count 614
Applied a total of 65 rules in 64 ms. Remains 169 /202 variables (removed 33) and now considering 614/726 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 169/202 places, 614/726 transitions.
RANDOM walk for 40000 steps (922 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (192 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 772240 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 1
Probabilistic random walk after 772240 steps, saw 171543 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
[2025-05-31 10:38:13] [INFO ] Flow matrix only has 606 transitions (discarded 8 similar events)
// Phase 1: matrix 606 rows 169 cols
[2025-05-31 10:38:13] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 10:38:13] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/29 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/179 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 592/771 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/771 variables, 83/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/771 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/775 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/775 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/775 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 775/775 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/179 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 592/771 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/771 variables, 83/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/771 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/775 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/775 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/775 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 775/775 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 614/614 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 614/614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 169/169 places, 614/614 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 614/614 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 614/614 (removed 0) transitions.
[2025-05-31 10:38:14] [INFO ] Flow matrix only has 606 transitions (discarded 8 similar events)
[2025-05-31 10:38:14] [INFO ] Invariant cache hit.
[2025-05-31 10:38:14] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-05-31 10:38:14] [INFO ] Flow matrix only has 606 transitions (discarded 8 similar events)
[2025-05-31 10:38:14] [INFO ] Invariant cache hit.
[2025-05-31 10:38:15] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-05-31 10:38:15] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2025-05-31 10:38:15] [INFO ] Redundant transitions in 13 ms returned []
Running 606 sub problems to find dead transitions.
[2025-05-31 10:38:15] [INFO ] Flow matrix only has 606 transitions (discarded 8 similar events)
[2025-05-31 10:38:15] [INFO ] Invariant cache hit.
[2025-05-31 10:38:15] [INFO ] State equation strengthened by 83 read => feed constraints.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-20"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-20, 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 r098-smll-174860112300248"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "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 ;